330 search results - page 54 / 66 » On Modular Termination Proofs of General Logic Programs |
118
click to vote
GPCE
2008
Springer
15 years 4 months ago
2008
Springer
The influential pure embedding methodology of embedding domainspecific languages (DSLs) as libraries into a general-purpose host language forces the DSL designer to commit to a ...
138
click to vote
AOSD
2007
ACM
15 years 7 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
149
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
121
click to vote
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
149
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...