215 search results - page 35 / 43 » Verifying haskell programs using constructive type theory |
CADE
2001
Springer
14 years 9 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
IFIP
2001
Springer
14 years 1 months ago
2001
Springer
This paper uses semiotic theories to model how meaning is constructed during an IS development project. Conventionally, shared meanings among all project stakeholders are regarded...
SIGDOC
2003
ACM
14 years 2 months ago
2003
ACM
Artificial intelligence techniques have found a number of applications in hypermedia, mostly in two specific areas, user interface, particularly adaptive ones and information sear...
POPL
2001
ACM
14 years 9 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...