3440 search results - page 344 / 688 » Logics For Context-Free Languages |
178
click to vote
ESOP
2001
Springer
16 years 2 days ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
204
Voted
ENTCS
2007
15 years 7 months ago
2007
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
214
Voted
PPDP
2009
Springer
16 years 2 months ago
2009
Springer
“Scrap Your Boilerplate” (SYB) is an established style of generic functional programming. The present paper reconstructs SYB within the Prolog language with the help of the un...
207
Voted
TLCA
2005
Springer
16 years 1 months ago
2005
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
224
Voted
IFIP
2004
Springer
16 years 29 days ago
2004
Springer
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification con...