Sciweavers

1999 search results - page 90 / 400
» Dependently Typed Grammars
Sort
View
ICFP
2002
ACM
16 years 6 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
ICFP
2010
ACM
15 years 7 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
POPL
2008
ACM
16 years 6 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
LREC
2008
113views Education» more  LREC 2008»
15 years 7 months ago
Treebank-Based Acquisition of LFG Parsing Resources for French
Motivated by the expense in time and other resources to produce hand-crafted grammars, there has been increased interest in automatically obtained wide-coverage grammars from tree...
Natalie Schluter, Josef van Genabith
CONCUR
2001
Springer
15 years 10 months ago
The Control of Synchronous Systems, Part II
Abstract. A controller is an environment for a system that achieves a particular control objective by providing inputs to the system without constraining the choices of the system....
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...