86 search results - page 1 / 18 » Constructive Data Refinement in Typed Lambda Calculus |
FOSSACS
2000
Springer
13 years 8 months ago
2000
Springer
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constru...
FUIN
2010
13 years 3 months ago
2010
Abstract. We present the type rules for a dependently typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary t...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
for an informal presentation at CIE 2007 [2] is a typed -calculus that pursues the reuse of the term constructions both at the level of types and at the level of contexts, while en...
LICS
2012
IEEE
11 years 7 months ago
2012
IEEE
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
TYPES
1998
Springer
13 years 9 months ago
1998
Springer