TCS
1998
13 years 10 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
ENTCS
2002
13 years 10 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
ENTCS
2008
13 years 11 months ago
2008
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
FPCA
1989
14 years 2 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
SAS
1997
Springer
14 years 2 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
FCT
2005
Springer
14 years 4 months ago
2005
Springer
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...
FOSSACS
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
ESOP
2009
Springer
14 years 5 months ago
2009
Springer
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...