Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,167,426 papers from all fields of science
Search
Sign In
Create Free Account
Occurs check
Known as:
Occur check
In computer science, the occurs check is a part of algorithms for syntactic unification. It causes unification of a variable V and a structure S to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Algorithm
Computer science
Conjunctive normal form
First-order logic
Expand
Broader (2)
Automated theorem proving
Logic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Uniqueness of Normal Forms and Modularity of Confluence for Term Rewriting Systems
Rakesh M. Verma
2011
Corpus ID: 19035179
Programming language interpreters, proving theorems of the form A = B, abstract data types and program optimization can all be…
Expand
2008
2008
Constraint-Based Typing for ML via Semiunification Computer Science Technical Report CS-2008-10 Brad
Brad Lushman
,
G. Cormack
2008
Corpus ID: 85026
We characterize ML type inference as a constraint satisfaction based on a new generalization of the semiunification problem…
Expand
2007
2007
Realizing Substitution Instances of Modal Theorems
Melvin Fitting
2007
Corpus ID: 15268962
Suppose X is a theorem of S4, and a realization for X has been constructed. If X ′ is a substitution instance of X, it is also a…
Expand
2005
2005
Incremental Refinement of Success Patterns of Logic Programs
Lunjin Lu Oakland
2005
Corpus ID: 992858
domain. The safeness of the analysis is veri ed by formalising a correspondence between the concrete domain and the abstract…
Expand
2005
2005
Properties of a Rewrite System for Unification with Expansion Variables ⋆
Adam Bakewell
,
A. Kfoury
2005
Corpus ID: 2664155
A study of properties of a rewrite system for solving constraint sets that are instances of the unification with expansion…
Expand
2003
2003
The Occur-check Problem
P. Deransart
,
Jan Maluszy¿ski
2003
Corpus ID: 126157162
This chapter contains sections titled: The problem, The occur-check problem for a system of equations, The occur-check problem…
Expand
2001
2001
CORRECTNESS OF UNIFICATION WITHOUT OCCUR CHECK
D. Plaisted
2001
Corpus ID: 19172849
D For efficiency reasons, most Prolog implementations do not include an occur check in their unification algorithms and thus do…
Expand
1996
1996
A Comparison of Three Occur-check Analysers a Comparison of Three Occur-check Analysers
Andrew D. Kellyy
1996
Corpus ID: 10369160
A well known problem of most Prolog interpreters and compilers is the lack of occur-check in the implementation of the uniication…
Expand
1994
1994
Logic Programming with the Occur-check
P. Hill
1994
Corpus ID: 16985031
We present a new procedure based on abstract interpretation for determining where the occur-check may be safely omitted from…
Expand
1989
1989
On the Uniquely Converging Property of Nonlinear Term Rewriting Systems
Mizuhito Ogawa
,
S. Ono
1989
Corpus ID: 17659006
A uniquely converging (UC) property for a possibly nonlinear term rewriting system (TRS) is investigated. UC, which is an…
Expand