2529 search results - page 426 / 506 » The Logical Structure of Binding |
ICFP
2006
ACM
15 years 10 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
ICFP
2005
ACM
15 years 10 months 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...
ICFP
2003
ACM
15 years 10 months ago
2003
ACM
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
ICFP
2003
ACM
15 years 10 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
ICFP
2002
ACM
15 years 10 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...