394 search results - page 61 / 79 » Formal polytypic programs and proofs |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
VL
2003
IEEE
14 years 1 months ago
2003
IEEE
ct How can rigorous forms of testing be supported in a way that is both compatible with the visual aspect of visual programming languages, and usable by the audiences using those l...
DLS
2008
13 years 9 months ago
2008
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
TPHOL
2007
IEEE
14 years 2 months ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...