632 search results - page 112 / 127 » Explicit Substitutions and Programming Languages |
177
Voted
POPL
2008
ACM
16 years 9 hour ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
KBSE
2005
IEEE
15 years 5 months ago
2005
IEEE
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
OOPSLA
2005
Springer
15 years 5 months ago
2005
Springer
It is now well established that the device scaling predicted by Moore’s Law is no longer a viable option for increasing the clock frequency of future uniprocessor systems at the...
118
click to vote
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
170
click to vote
ICLP
2009
Springer
16 years 10 days ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...