134 search results - page 10 / 27 » Higher-Order and Semantic Unification |
CSL
1999
Springer
14 years 22 days ago
1999
Springer
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
CAV
2009
Springer
14 years 9 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
ENTCS
2008
13 years 8 months ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
POPL
1990
ACM
14 years 14 days ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
ESOP
2009
Springer
14 years 3 months ago
2009
Springer
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...