249 search results - page 30 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
ML
2008
ACM
13 years 8 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
POPL
2001
ACM
14 years 9 months ago
2001
ACM
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
APLAS
2007
ACM
14 years 19 days 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...
JMLR
2008
13 years 8 months ago
2008
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
RTA
2007
Springer
14 years 2 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...