1999 search results - page 129 / 400 » Dependently Typed Grammars |
216
click to vote
ENTCS
2006
15 years 6 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
192
click to vote
ICFP
2012
ACM
13 years 8 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...
195
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
182
click to vote
JSC
2002
15 years 6 months ago
2002
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
135
click to vote
SRDS
1997
IEEE
15 years 10 months ago
1997
IEEE
When creating mission-critical distributed systems using off-the-shelf components, it is important to assess the dependability of not only the hardware, but the software as well. ...