360 search results - page 7 / 72 » Dependently Typed Programming in Agda |
FLOPS
2010
Springer
14 years 2 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
AFP
2004
Springer
14 years 29 days ago
2004
Springer
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...
PLPV
2010
ACM
14 years 4 months ago
2010
ACM
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...