91 search results - page 12 / 19 » Inductive Beluga: Programming Proofs |
252
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
134
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
134
click to vote
PPDP
2009
Springer
15 years 10 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
135
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
156
click to vote
LPKR
1997
Springer
15 years 8 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...