3001 search results - page 91 / 601 » Recursive type generativity |
114
click to vote
FPCA
1989
15 years 6 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...
126
Voted
ICFP
2005
ACM
16 years 2 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...
135
Voted
FPCA
1989
15 years 6 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...
148
click to vote
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
In this paper, we present an attribute graph grammar for image parsing on scenes with man-made objects, such as buildings, hallways, kitchens, and living rooms. We choose one clas...
117
click to vote
ICFP
2007
ACM
15 years 6 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...