3319 search results - page 326 / 664 » Subshifts, Languages and Logic |
196
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
171
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
159
Voted
ESOP
2001
Springer
15 years 11 months 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...
179
click to vote
ENTCS
2007
15 years 6 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...
193
click to vote
PPDP
2009
Springer
16 years 1 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...