400 search results - page 26 / 80 » Logical relations for monadic types |
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
EGC
2005
Springer
14 years 1 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....