91 search results - page 7 / 19 » A Simple Semantics for Polymorphic Recursion |
ESOP
2003
Springer
14 years 27 days ago
2003
Springer
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...