Sciweavers

2 search results - page 1 / 1
» Third-Order Matching in the Polymorphic Lambda Calculus
Sort
View
HOA
1995
13 years 8 months ago
Third-Order Matching in the Polymorphic Lambda Calculus
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
Jan Springintveld
LICS
2008
IEEE
13 years 11 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy