Sciweavers

215 search results - page 34 / 43
» Verifying haskell programs using constructive type theory
Sort
View
POPL
2006
ACM
14 years 9 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
POPL
1990
ACM
14 years 1 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
ICFP
2012
ACM
11 years 11 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
OOPSLA
2005
Springer
14 years 2 months ago
Subtext: uncovering the simplicity of programming
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
Jonathan Edwards
ICFP
2009
ACM
14 years 9 months ago
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
Tiark Rompf, Ingo Maier, Martin Odersky