Sciweavers

54 search results - page 1 / 11
» A Tutorial Implementation of a Dependently Typed Lambda Calc...
Sort
View
FUIN
2010
156views more  FUIN 2010»
13 years 2 months ago
A Tutorial Implementation of a Dependently Typed Lambda Calculus
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...
Andres Löh, Conor McBride, Wouter Swierstra
LICS
2012
IEEE
11 years 6 months ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—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...
Naohiko Hoshino
ICFP
2004
ACM
14 years 4 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
PEPM
1997
ACM
13 years 8 months ago
A Type-directed, On-line, Partial Evaluator for a Polymorphic Language
Recently, Olivier Danvy introduced a new, simple method for implementing powerful partial evaluators, namely typedirected partial evaluation 9 . He introduced a partial evaluator ...
Tim Sheard
CORR
2006
Springer
137views Education» more  CORR 2006»
13 years 4 months ago
Lambda Types on the Lambda Calculus with Abbreviations
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...
F. Guidi