Add to ORKGWe formalize the Z property introduced by Dehornoy and van Oostrom. First we show that for any abstract rewrite system, Z implies confluence. Then we give two examples of proofs using Z: confluence of lambda-calculus with respect to beta-reduction and confluence of combinatory logic
The confluence of untyped λ-calculus with unconditional rewriting is now well un-derstood. In this p...
This paper provides an introduction to the specification language Z from a logical perspective. The ...
The confluence of untyped #-calculus with unconditional rewriting has already been studied in vario...
5th International Workshop on Confluence5th International Workshop on ConfluenceWe present a short p...
We provide an introduction to the specification language Z from a logical perspective. The possibili...
The popularity and flexibility of the Z notation can largely be attributed to its notion of schemas....
International audienceWe develop techniques based on van Oostrom's decreasing diagrams that reduce c...
AbstractThe popularity and flexibility of the Z notation can largely be attributed to its notion of ...
The popularity and flexibility of the Z notation can largely be attributed to its notion of schemas....
AbstractIn Hoare and He's unifying theories of programming, the alphabetised relational calculus is ...
We show confluence of a conditional term rewriting system CL-pc^1, which is an extension of Combinat...
Despite being widely regarded as a gloss on first-order logic and set theory, Z has not been found t...
Z is a formal specification language combining typed set theory, predicate calculus, and a schema ca...
This paper provides an introduction to the specification language Z from a logical perspective. The ...
Z is a formal specification language combining typed set theory, predicate calculus, and a schema ca...
The confluence of untyped λ-calculus with unconditional rewriting is now well un-derstood. In this p...
This paper provides an introduction to the specification language Z from a logical perspective. The ...
The confluence of untyped #-calculus with unconditional rewriting has already been studied in vario...
5th International Workshop on Confluence5th International Workshop on ConfluenceWe present a short p...
We provide an introduction to the specification language Z from a logical perspective. The possibili...
The popularity and flexibility of the Z notation can largely be attributed to its notion of schemas....
International audienceWe develop techniques based on van Oostrom's decreasing diagrams that reduce c...
AbstractThe popularity and flexibility of the Z notation can largely be attributed to its notion of ...
The popularity and flexibility of the Z notation can largely be attributed to its notion of schemas....
AbstractIn Hoare and He's unifying theories of programming, the alphabetised relational calculus is ...
We show confluence of a conditional term rewriting system CL-pc^1, which is an extension of Combinat...
Despite being widely regarded as a gloss on first-order logic and set theory, Z has not been found t...
Z is a formal specification language combining typed set theory, predicate calculus, and a schema ca...
This paper provides an introduction to the specification language Z from a logical perspective. The ...
Z is a formal specification language combining typed set theory, predicate calculus, and a schema ca...
The confluence of untyped λ-calculus with unconditional rewriting is now well un-derstood. In this p...
This paper provides an introduction to the specification language Z from a logical perspective. The ...
The confluence of untyped #-calculus with unconditional rewriting has already been studied in vario...