230 search results - page 17 / 46 » Automation for Dependently Typed Functional Programming |
POPL
1997
ACM
13 years 12 months ago
1997
ACM
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
FROCOS
2011
Springer
12 years 7 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
Airport Baggage Handling is a field of automation systems that is currently dependent on centralised control systems and conventional automation programming techniques. In this and...
ICFP
2012
ACM
11 years 10 months ago
2012
ACM
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...