Occur-Check

1984

• David A. Plaisted: The Occur-Check Problem in Prolog. SLP 1984: 272-280

1986

• Harald Søndergaard: An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction. ESOP 1986: 327-338

1991

• Pierre Deransart, Gérard Ferrand, Michel Téguia: NSTO Programs (Not Subject to Occur-Check). ISLP 1991: 533-547

1992

• Krzysztof R. Apt, Alessandro Pellegrini: Why the Occur-Check is Not a Problem. PLILP 1992: 69-86
• Ulrich Neumerkel: Pruning Infinite Failure Branches in Programs with Occur-Check. LPAR 1992: 172-177

1994

• Krzysztof R. Apt, Alessandro Pellegrini: On the Occur-Check-Free Prolog Programs. ACM Trans. Program. Lang. Syst. 16(3): 687-726(1994)
• Ritu Chadha, David A. Plaisted: Correctness of Unification Without Occur Check in Prolog. J. Log. Program. 18(2): 99-122(1994)