3713 search results - page 215 / 743 » Constructing a Calculus of Programs |
160
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
133
Voted
PLDI
2011
ACM
14 years 6 months ago
2011
ACM
Programming language design benefits from constructs for extending the syntax and semantics of a host language. While C’s stringbased macros empower programmers to introduce no...
129
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
111
click to vote
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...