| A Compositional Approach to Network Algorithms. | 1 | 0.87 | 2018 |
| Linear Arrangement of Halin Graphs | 0 | 0.34 | 2015 |
| The syntax and semantics of a domain-specific language for flow-network design | 2 | 0.42 | 2014 |
| A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems | 4 | 0.41 | 2010 |
| Programming Examples Needing Polymorphic Recursion | 5 | 0.43 | 2005 |
| System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types | 13 | 0.61 | 2004 |
| Principality and type inference for intersection types using expansion variables | 42 | 1.53 | 2004 |
| A typed model for encoding-based protocol interoperability | 0 | 0.34 | 2004 |
| Systematic verification of safety properties of arbitrary network protocol compositions using CHAIN | 4 | 0.53 | 2003 |
| What Are Polymorphically-Typed Ambients? | 25 | 1.14 | 2001 |
| Type theory and rewriting theory for expressive, efficient and reliable programming languages | 0 | 0.34 | 2000 |
| A Linearization of the Lambda Calculus and Consequences | 15 | 1.12 | 2000 |
| Alpha-conversion and typability | 3 | 0.43 | 1999 |
| Principality and decidable type inference for finite-rank intersection types | 42 | 1.61 | 1999 |
| An infinite pebble game and applications | 2 | 0.49 | 1997 |
| Recursion Versus Iteration at Higher-Orders | 3 | 0.50 | 1997 |
| New Notions of Reduction and Non-Semantic Proofs of Beta-Strong Normalization in Typed Lambda-Calculi | 12 | 0.88 | 1995 |
| A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus | 34 | 2.10 | 1994 |
| An analysis of ML typability | 31 | 2.44 | 1994 |
| The undecidability of the semi-unification problem | 61 | 5.38 | 1993 |
| Type reconstruction in the presence of polymorphic recursion | 46 | 3.28 | 1993 |
| On The Expressive Power Of Finitely Typed And Universally Polymorphic Recursive Procedures | 2 | 0.62 | 1992 |
| Type reconstruction in finite rank fragments of the second-order &lgr;-calculus | 18 | 1.56 | 1992 |
| The Undecidability of the Semi-Unification Problem (Preliminary Report) | 7 | 1.98 | 1990 |
| ML typability is Dexptime-complete | 15 | 2.30 | 1990 |
| Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary) | 1 | 0.35 | 1990 |
| Minutes of the 4th annual LICS business meeting | 0 | 0.34 | 1989 |
| Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) | 5 | 1.39 | 1989 |
| Algol-like languages with higher-order procedures and their expressive power | 1 | 0.36 | 1989 |
| A proper extension of ML with an effective type-assignment | 14 | 2.02 | 1988 |
| On the Computational Power of Universally Polymorphic Recursion | 1 | 0.37 | 1988 |
| The Hierarchy of Finitely Typed Functional Programs (Short Version) | 4 | 1.84 | 1987 |
| A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap | 12 | 1.78 | 1986 |
| Necessary and sufficient conditions for the universality of programming formalisms | 12 | 1.15 | 1985 |
| The unwind property for programs with bounded memory | 2 | 0.36 | 1985 |
| Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic) | 2 | 0.42 | 1985 |
| Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report) | 0 | 0.34 | 1983 |
| Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic | 0 | 0.34 | 1981 |
| Analysis of simple programs over different sets of primitives | 2 | 0.40 | 1980 |
| Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report) | 0 | 0.34 | 1980 |
| On the Termination of Program Schemas | 12 | 2.80 | 1975 |
| Translatability of schemas over restricted interpretations | 6 | 1.09 | 1974 |
