1999 search results - page 32 / 400 » Dependently Typed Grammars |
127
click to vote
ICFP
2008
ACM
16 years 1 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...
135
click to vote
AFP
2004
Springer
15 years 7 months 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...
120
click to vote
PADL
2004
Springer
15 years 7 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
129
click to vote
FLOPS
2010
Springer
15 years 8 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...
117
click to vote
ESOP
2008
Springer
15 years 3 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...