Sciweavers

92 search results - page 6 / 19
» The simply typed rewriting calculus
Sort
View
ENTCS
2000
114views more  ENTCS 2000»
13 years 7 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann
POPL
1989
ACM
13 years 11 months ago
Dynamic Typing in a Statically-Typed Language
Dynamic typing can be useful in statically typed languages. We extend the simply typed λ-calculus with dynamic typing and elaborate additional features like polymorphism and subty...
Martín Abadi, Luca Cardelli, Benjamin C. Pi...
ADBIS
2004
Springer
93views Database» more  ADBIS 2004»
14 years 26 days ago
Query Rewriting Using Views in a Typed Mediator Environment
Abstract. Query rewriting method is proposed for the heterogeneous information integration infrastructure formed by the subject mediator environment. Local as View (LAV) approach t...
Leonid A. Kalinichenko, Dmitry O. Martynov, Sergey...
TCS
1998
13 years 7 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
CSL
2009
Springer
14 years 2 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux