CTRS 1990 | Sciweavers

24

click to vote

CTRS
1990

49views Theoretical Computer Science» more CTRS 1990»

A Simplifier for Untyped Lambda Expressions

14 years 3 months ago

Download infolab.stanford.edu

Louis Galbiati, Carolyn L. Talcott

claim paper

Read More »

25

click to vote

CTRS
1990

68views Theoretical Computer Science» more CTRS 1990»

A Maximal-Literal Unit Strategy for Horn Clauses

14 years 3 months ago

Download www.cs.tau.ac.il

A new positive-unit theorem-proving procedure for equational Horn clauses is presented. It uses a term ordering to restrict paxamodulation to potentiallymaximal sides of equations...

Nachum Dershowitz

claim paper

Read More »

35

click to vote

CTRS
1990

120views Theoretical Computer Science» more CTRS 1990»

Completion Procedures as Semidecision Procedures

14 years 3 months ago

Download profs.sci.univr.it

Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...

Maria Paola Bonacina, Jieh Hsiang

claim paper

Read More »

28

click to vote

CTRS
1990

41views Theoretical Computer Science» more CTRS 1990»

Extended Term Rewriting Systems

14 years 3 months ago

Download web.mac.com

Jan Willem Klop, Roel C. de Vrijer

claim paper