191 search results - page 31 / 39 » Propositional theories are strongly equivalent to logic prog... |
155
click to vote
TLCA
2009
Springer
16 years 18 days 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...
173
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
158
click to vote
PPDP
2007
Springer
16 years 5 days ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
155
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
257
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....