55 search results - page 5 / 11 » Compilation of LOTOS Abstract Data Types |
129
click to vote
ICFP
1997
ACM
15 years 6 months ago
1997
ACM
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
204
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
156
click to vote
WOLLIC
2010
Springer
15 years 20 days ago
2010
Springer
Abstract. The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types p...
107
click to vote
PLDI
2012
ACM
13 years 4 months ago
2012
ACM
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
123
Voted
APLAS
2007
ACM
15 years 6 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...