222 search results - page 32 / 45 » Subject Reduction of Logic Programs as Proof-Theoretic Prope... |
77
Voted
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
104
Voted
TLDI
2010
ACM
15 years 8 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
116
Voted
SIGSOFT
2007
ACM
16 years 12 days ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
104
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
198
click to vote
POPL
2005
ACM
15 years 12 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...