Sciweavers

1026 search results - page 43 / 206
» A Methodology for Equational Reasoning
Sort
View
RTA
1995
Springer
13 years 11 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
LICS
2008
IEEE
14 years 2 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
KR
2004
Springer
14 years 1 months ago
Characterization of Semantics for Argument Systems
We consider Dung’s argumentation framework, in which an argument system consists of a set of arguments and a binary relation between arguments representing the notion of a con...
Philippe Besnard, Sylvie Doutre
LICS
1994
IEEE
13 years 12 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
TPHOL
2009
IEEE
14 years 2 months ago
Some Domain Theory and Denotational Semantics in Coq
Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-...
Nick Benton, Andrew Kennedy, Carsten Varming