797 search results - page 55 / 160 » Eliminating Proofs from Programs |
106
click to vote
ESORICS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Cryptographic protocols are useful for engineering trust in transactions. There are several languages for describing these protocols, but these tend to capture the commun...
111
Voted
AIML
2008
15 years 2 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
137
click to vote
DALT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
JAR
2008
15 years 20 days ago
2008
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equat...
112
click to vote
FPCA
1995
15 years 4 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...