Results 1  10
of
19
Normalization and partial evaluation
 Applied Semantics, number 2395 in LNCS
, 2002
"... Abstract. We give an introduction to normalization by evaluation and typedirected partial evaluation. We first present normalization by evaluation for a combinatory version of Gödel System T. Then we show normalization by evaluation for typed lambda calculus with β and η conversion. Finally, we int ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Abstract. We give an introduction to normalization by evaluation and typedirected partial evaluation. We first present normalization by evaluation for a combinatory version of Gödel System T. Then we show normalization by evaluation for typed lambda calculus with β and η conversion. Finally, we introduce the notion of binding time, and explain the method of typedirected partial evaluation for a small PCFstyle functional programming language. We give algorithms for both callbyname and callbyvalue versions of this language.
A finite semantics of simplytyped lambda terms for infinite runs of automata
 Procedings of the 20th international Workshop on Computer Science Logic (CSL ’06), volume 4207 of Lecture Notes in Computer Science
, 2006
"... Vol. 3 (3:1) 2007, pp. 1–23 ..."
(Show Context)
Inclusion Constraints over Nonempty Sets of Trees
, 1997
"... We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 `t2 between firstorder terms (without set operators) which are interpreted over nonempty sets of trees. The existing systems of set constraints can express INES constraints only if they include ne ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 `t2 between firstorder terms (without set operators) which are interpreted over nonempty sets of trees. The existing systems of set constraints can express INES constraints only if they include negation. Their satisfiability problem is NEXPTIMEcomplete. We present an incremental algorithm that solves the satisfiability problem of INES constraints in cubic time. We intend to apply INES constraints for type analysis for a concurrent constraint programming language.
Operational Aspects of Untyped Normalization by Evaluation
, 2003
"... A purely syntactic and untyped variant of Normalization by Evaluation for the λcalculus... ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
A purely syntactic and untyped variant of Normalization by Evaluation for the &lambda;calculus...
Infinite rewriting: from syntax to semantics
 In Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday
, 2005
"... Rewriting is the repeated transformation of a structured object according to a set of rules. This simple concept has turned out to have a rich variety of elaborations, giving rise to many different theoretical frameworks for reasoning about computation. Aside from its theoretical importance, rewriti ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Rewriting is the repeated transformation of a structured object according to a set of rules. This simple concept has turned out to have a rich variety of elaborations, giving rise to many different theoretical frameworks for reasoning about computation. Aside from its theoretical importance, rewriting has also
Operational Aspects of Normalization by Evaluation
, 2001
"... A purely syntactic and untyped variant of Normalization by Evaluation for the calculus is presented in the framework of a twolevel calculus with rewrite rules to model the inverse of the evaluation functional. Among its operational properties gures a standardization theorem that formally establi ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
A purely syntactic and untyped variant of Normalization by Evaluation for the calculus is presented in the framework of a twolevel calculus with rewrite rules to model the inverse of the evaluation functional. Among its operational properties gures a standardization theorem that formally establishes adequacy of implementation in functional programming languages. An example implementation in Haskell is provided. The relation to usual typedirected Normalization by Evaluation is highlighted, using a short analysis of expansion that leads to a perspicuous strong normalization and conuence proof for "reduction as a byproduct.
Interpreting functions as πcalculus processes: a tutorial
, 1999
"... This paper is concerned with the relationship betweencalculus and ��calculus. Thecalculus talks about functions and their applicative behaviour. This contrasts with the ��calculus, that talks about processes and their interactive behaviour. Application is a special form of interaction, and there ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is concerned with the relationship betweencalculus and ��calculus. Thecalculus talks about functions and their applicative behaviour. This contrasts with the ��calculus, that talks about processes and their interactive behaviour. Application is a special form of interaction, and therefore functions can be seen as a special form of processes. We study how the functions of thecalculus (the computable functions) can be represented as ��calculus processes. The ��calculus semantics of a language induces a notion of equality on the terms of that language. We therefore also analyse the equality among functions that is induced by their representation as ��calculus processes. This paper is intended as a tutorial. It however contains some original contributions. The main ones are: the use of wellknown Continuation Passing Style transforms to derive the encodings into ��calculus and prove their correctness; the encoding of typedcalculi.
Combinatory Models and Symbolic Computation
 Lecture Notes in Computer Science , Springer Verlag 721
, 1992
"... Weintroduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of algebraic computation and on an other level approximate computation is represented. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Weintroduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of algebraic computation and on an other level approximate computation is represented.
Programming Research Group
"... This thesis is a detailed examination of the application of game semantics to constructing denotational models of the pure untyped λcalculus. Game semantics is a fairly recent technique, using a formal setting for interaction to model sequential programming languages in an accurate way. syntaxinde ..."
Abstract
 Add to MetaCart
This thesis is a detailed examination of the application of game semantics to constructing denotational models of the pure untyped λcalculus. Game semantics is a fairly recent technique, using a formal setting for interaction to model sequential programming languages in an accurate way. syntaxindependent model of PCF; the only difference is that in our setting the distinction between “question ” and “answer ” moves is removed. Many of the standard results for PCF games carry through into this setting. Cartesian closed categories of arenas and innocent strategies are constructed, leading to ληalgebras D and DREC. By a method of approximation, these are shown to be sensible models (i.e. all unsolvable terms are equated) but they contain many undefinable elements and are not λmodels. By introducing a new “economical ” representation of innocent strategies we are able to prove a precise syntactic connexion between a term and its denotation. This