3513 search results - page 495 / 703 » Super Logic Programs |
200
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
118
Voted
ICFP
2008
ACM
16 years 23 days ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
81
Voted
ICFP
2005
ACM
16 years 23 days ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
90
Voted
ICFP
2003
ACM
16 years 23 days ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
118
Voted
TLDI
2010
ACM
15 years 9 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...