Sciweavers

91 search results - page 13 / 19
» A Simple Semantics for Polymorphic Recursion
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
ICCL
1998
IEEE
13 years 12 months ago
Modular Compilers Based on Monad Transformers
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
William L. Harrison, Samuel N. Kamin
ICFP
2001
ACM
14 years 7 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
JCDL
2003
ACM
94views Education» more  JCDL 2003»
14 years 28 days ago
Content Access Characterization in Digital Libraries
To support non-trivial clients, such as data exploration and analysis environments, digital libraries must be able to describe the access modes that their contents support. We pre...
Greg Janee, James Frew, David Valentine
ICFP
1999
ACM
13 years 12 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...