Sciweavers

Share
TCS
1998
8 years 9 months ago
Unary PCF is Decidable
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...
Ralph Loader
ENTCS
2002
129views more  ENTCS 2002»
8 years 10 months ago
Eliminating Proofs from Programs
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...
Femke van Raamsdonk, Paula Severi
ENTCS
2008
126views more  ENTCS 2008»
8 years 10 months ago
Comonadic Notions of Computation
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...
Tarmo Uustalu, Varmo Vene
FPCA
1989
9 years 2 months ago
A Simple Semantics for ML Polymorphism
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...
Atsushi Ohori
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
9 years 2 months ago
Exact Flow Analysis
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 ...
Christian Mossin
FCT
2005
Springer
9 years 3 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
FOSSACS
2009
Springer
9 years 5 months ago
Dependency Tree Automata
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...
Colin Stirling
ESOP
2009
Springer
9 years 5 months ago
Exploring the Design Space of Higher-Order Casts
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...
Jeremy G. Siek, Ronald Garcia, Walid Taha
books