"On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite ..."

Enno Ohlebusch (1999)

> Home

Details and statistics

DOI: 10.1007/10705424_12

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/flops/Ohlebusch99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/flops/Ohlebusch99
Enno Ohlebusch:
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. Fuji International Symposium on Functional and Logic Programming 1999: 179-193

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.