90 search results - page 4 / 18 » Narrowing and Rewriting Logic: from Foundations to Applicati... |
CSL
2007
Springer
14 years 13 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
POPL
2003
ACM
14 years 6 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
CADE
2008
Springer
14 years 6 months ago
2008
Springer
Collaborative Programming is characterized by groups of people issuing instructions to computer systems. Collaborative Programming languages differ from traditional programming lan...
RC
2002
13 years 5 months ago
2002
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
ASE
2005
13 years 6 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...