81 search results - page 5 / 17 » Functional translation of a calculus of capabilities |
PPDP
2010
Springer
13 years 4 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
JAR
2010
13 years 5 months ago
2010
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
FM
2005
Springer
14 years 7 days ago
2005
Springer
Abstract. Control diagrams are routinely used by engineers in the design of control systems. Yet, currently the formal verification of programs that implement the diagrams is a ch...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
ACL2
2006
ACM
14 years 20 days ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...