Sciweavers

429 search results - page 23 / 86
» Polymorphic typed defunctionalization
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...
LICS
2012
IEEE
11 years 10 months ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
Naohiko Hoshino
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ICFP
2005
ACM
14 years 7 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen