Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Qu-Prolog unification algorithm: formalisation and correctness

From MaRDI portal
Publication:1349886
Jump to:navigation, search

DOI10.1016/S0304-3975(96)00115-6zbMath0874.68134WikidataQ127952218 ScholiaQ127952218MaRDI QIDQ1349886

Peter Nickolas, Peter J. Robinson

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)



Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)


Related Items

Nominal unification ⋮ Ergo 6: A Generic Proof Engine that Uses Prolog Proof Technology ⋮ Contextual equivalence for inductive definitions with binders in higher order typed functional programming


Uses Software

  • Qu-Prolog


Cites Work

  • Substitution revisited
  • A unification algorithm for typed \(\overline\lambda\)-calculus
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1349886&oldid=13485629"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki