Sciweavers

200 search results - page 4 / 40
» The Intensional Lambda Calculus
Sort
View
PEPM
1997
ACM
14 years 1 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
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 3 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
ICFP
2006
ACM
14 years 9 months ago
Access control in a core calculus of dependency
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in information-f...
Martín Abadi
AMC
2006
125views more  AMC 2006»
13 years 10 months ago
A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Churc...
Seref Mirasyedioglu, Tolga Güyer
AML
2002
112views more  AML 2002»
13 years 9 months ago
Strong normalization of a symmetric lambda calculus for second-order classical logic
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
Yoriyuki Yamagata