Sciweavers

135 search results - page 6 / 27
» A typed lambda calculus with intersection types
Sort
View
LICS
2012
IEEE
11 years 9 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
PEPM
1997
ACM
13 years 11 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
FCT
2005
Springer
14 years 1 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
ECOOP
1998
Springer
13 years 11 months ago
On Object Extension
The last few years have seen the development of statically typed object based (also called prototype-based) programming languages. Two proposals, namely the Lambda Calculus of Obje...
Luigi Liquori
LICS
2002
IEEE
14 years 11 days ago
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat