91 search results - page 2 / 19 » A Simple Semantics for Polymorphic Recursion |
APLAS
2010
ACM
14 years 9 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
MSCS
2010
14 years 8 months ago
2010
tations of imperative abstract data types.
78
Voted
FPCA
1989
15 years 1 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
LICS
1989
IEEE
15 years 1 months ago
1989
IEEE
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yiel...