Researchers in Intersection Types and Related Systems
- Samson Abramsky - Oxford University Computing Laboratory
- (with Jensen (POPL '91), with Burn and Hankin (SCP '86)?)
- Alex Aiken
- program analysis, constraints, soft typing, union types, conditional types
- Yohji Akama
- normalization (?), combinators (?), ???
- Fabio Alessi - Università di Udine
- (MFCS '91 with Barbanera)
- Sandra Alves
- (linearization)
- Roberto M. Amadio - Université Paris 7
- survey, ???
- Torben Amtoft - Kansas State University
- correspondence with flow analysis frameworks
- Steffen van Bakel - Imperial College
- Currified TRSs, filter models, approximation models, type inference, relevant logic, call-by-value, normalization, combinators, approximants, expansion, finite-rank restriction, universal quantifiers, unification, type inference
- Anindya Banerjee
- polyvariant flow analysis, finite-rank restriction
- Franco Barbanera - Università di Catania
- expansion, finite-rank restriction, universal quantifiers, union types, unification, type inference, subtyping, approximants, Böhm trees, filter models
- Henk Barendregt - Radboud Universiteit Nijmegen
- filter models, ???
- Chantal Berline - Université Paris 7
- (just writing book?)
- Antonio Bucciarelli
- uniform definability, normalization, models
- Martin Büchi - Turku Center for Computer Science
- object-oriented, multiple subtyping, Java
- Martin Bunder - University of Wollongong
- Peter Buneman - University of Pennsylvania
- union types, semistructured databases, subtyping
- Felice Cardone - Università di Milano (e-mail: cardone aT dsi dOt unimi dOt it)
- ??? (paper with Coppo (on recursive types?)? APAL '94 paper (Cardone, Dezani, de'Liguoro)?)
- Sébastien Carlier
- expansion, expansion variables, omega expansion, type inference
- Giuseppe Castagna - LIENS (Laboratoire d'Informatique de l'Ecole Normale Supérieure)
- object-oriented programming, overloading, ??? (bad url! has he done intersection types?)
- Adriana Compagnoni - Stevens Institute of Technology
- subtyping, multiple inheritance, Fω
- Mario Coppo - Università di Torino
- independent originator (with Dezani-Ciancaglini), principality, unification, type inference, abstract interpretation, strictness analysis, totality analysis, refinement types, program analysis
- Karl Crary - Carnegie Mellon University
- object encodings
- Pierre-Louis Curien - Université Paris 7
- (has he done original intersection types or just book?)
- Luís Damas
- Ferruccio Damiani - Università di Torino
- strictness analysis, totality analysis, relevance, refinement types, program analysis
- Flemming M. Damm
- subtyping, union types, recursive types, type inference
- Rowan Davies
- refinement types, intersection types and value restriction
- Silvia De Lorenzis - Università di Roma "La Sapienza"
- uniform definability, normalization
- Mariangiola Dezani-Ciancaglini - Università di Torino
- independent originator (with Coppo), filter models, principality, union types, relevant logic, call-by-value, subtyping, nondeterminism, approximants, Böhm trees, combinatory logic, explicit substitutions, approximants, infinite rewriting
- Pietro Di Gianantonio - Università di Udine
- denotational semantics, applicative exponential structures
- Allyn Dimock - University of Massachusetts at Lowell
- union types, explicit typing, flow-directed program transformation, polyvariant flow analysis
- Dan Dougherty
- explicit substitutions
- Dirk Dussart - Katholieke Universiteit Leuven
- type specialization
- Jonathan Eifrig (e-mail: eifrig aT cs dOt jhu dOt edu)
- constrained types, multiple inheritance (with Smith and Trifonov)
- Maribel Fernández
- normalization, combinators, approximants, expansion, finite-rank restriction, universal quantifiers, unification, type inference, rewriting
- Alberto Ferrari
- (Master's thesis became TCS '93 article with Coppo.)
- Mário Florido - Universidade do Porto
- Philippa Gardner
- needed reductions
- Silvia Ghilezan - University of Novi Sad
- SN, typability, relevant logic, combinatory logic, union types, inhabitation
- Paola Giannini - Università di Torino
- type inference, strictness analysis, totality analysis, principality, unification, relevance, refinement types, program analysis
- Grzegorz Grudzi'nski - Uniwersytet Warszawski
- strictness analysis
- Christian Haack - Radboud Universiteit Nijmegen
- branching types
- Chris Hankin
- program analysis (has he done intersection types? writing book)
- Susumu Hayashi - Kobe University
- program extraction, singleton types, union types, refinement types
- Nevin Heintze - Bell Laboratories
- constraints, program analysis, flow analysis
- J. Roger Hindley - University of Wales Swansea
- combinatory logic, propositional logic
- Furio Honsell - Università di Udine
- filter models, denotational semantics, applicative exponential structures, perpetual strategies
- John Hughes - Chalmers tekniska högskola
- type specialization
- DeLesley Hutchins
- feature-oriented programming
- Bart Jacobs - Radboud Universiteit Nijmegen
- filter models (has he done intersection types? TCS '95 paper with Margaria and Zacchi)
- Thomas P. Jensen - IRISA/CNRS (Rennes, France)
- strictness analysis, program analysis, flow analysis, binding-time analysis, union types, abstract interpretation
- Trevor Jim - AT&T Research
- type inference, finite-rank restriction, unification, principality, recursive definitions, polar types
- Jean-Pierre Jouannaud
- (supervised Fernández)
- Assaf J. Kfoury - Boston University
- type inference algorithms, type inference complexity, expansion, principality, normalization, unification, finite-rank restriction
- Michael Kohlhase - Universität des Saarlandes
- higher-order unification
- Alexei Kopylov
- Jean-Louis Krivine - Université Paris 7
- chapter on intersection types in his book "Lambda-calculus, Types, Models"
- Toshihiko Kurata (e-mail: t-kurata aT comp dOt metro-u dOt ac dOt jp)
- inhabitation, Böhm trees
- T. K. Lakshman
- program analysis, constraints, soft typing, union types, conditional types
- Daniel Leivant - Indiana University
- finite-rank restriction, ??? (home page doesn't work)
- Stéphane Lengrand
- explicit substitutions
- Marina Lenisa
- perpetual strategies
- Pierre Lescanne
- explicit substitutions
- Ugo de'Liguoro - Università di Torino
- relevant logic, call-by-value, subtyping, union types, nondeterminism, filter models
- Luigi Liquori - Università di Udine
- ???
- Giuseppe Longo - École Normale Supérieure
- filter models, ??? (has he done intersection types? with Castagna?)
- Lunjin Lu
- Harry G. Mairson - Boston University
- type inference algorithms, type inference complexity, finite-rank restriction
- Ines Margaria - Università di Torino
- filter models, universal quantifiers, ???
- Ralph Matthes - Ludwig-Maximilians-Universität München
- Michel Mauny - INRIA Rocquencourt
- principality, normalization, ???
- Bob Meyer - Australian National University
- relevant logic
- Bruno Monsuez (e-mail: bruno.monsuez aT online dOt fr)
- abstract interpretation
- Yoko Motohama
- relevant logic, call-by-value (paper with van Bakel, Dezani, de'Liguoro)
- Bob Muller - Boston College
- union types, explicit typing, flow-directed program transformation, polyvariant flow analysis
- Peter Neergaard
- Aleksey Nogin
- Jens Palsberg - UCLA
- polyvariant flow analysis, union types, subtyping
- Frank Pfenning - Carnegie Mellon University
- refinement types, higher-order unification
- Benjamin C. Pierce - University of Pennsylvania
- subtyping, bounded quantification, type inference, programming, multiple inheritance, Fω, union types, semistructured databases
- Adolfo Piperno - Università di Roma "La Sapienza"
- extensionality, filter models, type inference, uniform definability, normalization, union types, nondeterminism
- Garrel Pottinger
- independent originator, strong normalization
- Laurent Regnier
- relation to interaction nets (in Ph.D. thesis)
- John C. Reynolds - Carnegie Mellon University
- Forsythe (programming language)
- Simona Ronchi Della Rocca - Università di Torino
- principality, unification, filter models, type inference, extensionality
- Luca Roversi - Università di Torino
- intersection logic
- Patrick Sallé - INP-ENSEEIHT (Toulouse, France) (e-mail: Patrick.Salle aT enseeiht dOt fr)
- independent originator
- Ivano Salvo - Università di Torino
- uniform definability, normalization
- Émilie Sayag - INRIA Rocquencourt
- principality, normalization
- Sven-Bodo Scholz - University of Hertfordshire
- inferring array shapes for compiler optimization
- Scott F. Smith - The Johns Hopkins University
- object-oriented, type inference, constrained types, subtyping, multiple inheritance
- Yiorgos Stavrinos (e-mail: g.stavrinos aT math dOt ntua dOt gr)
- Masako Takahashi (e-mail: masayo aT etl dOt go dOt jp)
- inhabitation
- Peter Thiemann - Universität Freiburg
- type specialization
- Valery Trifonov
- object-oriented, type inference, constrained types, subtyping, multiple inheritance (where is current home page? is e-mail correct?)
- Lyn Turbak - Wellesley College
- type inference algorithms, type inference complexity, union types, explicit typing, flow-directed program transformation, polyvariant flow analysis, finite-rank restriction
- Paweł Urzyczyn - Uniwersytet Warszawski
- inhabitation
- Betti Venneri - Università di Firenze
- principality, relevant logic, combinatory logic, union types
- Fer-Jan de Vries - University of Leicester
- approximants, Böhm trees
- Geoff Washburn
- Wolfgang Weck - Turku Center for Computer Science
- object-oriented, multiple subtyping, Java
- Joe Wells - Heriot-Watt University
- type inference algorithms, type inference complexity, expansion, principality, normalization, union types, explicit typing, flow-directed program transformation, polyvariant flow analysis, unification, finite-rank restriction
- Ian Westmacott
- Ed Wimmers - IBM Almaden Research Center
- program analysis, constraints, soft typing, union types, conditional types
- Hirofumi Yokouchi
- universal quantifiers, completeness of F-semantics, union types, completeness of type assignment systems
- Maddalena Zacchi - Università di Torino
- filter models, principality, universal quantifiers, ???