SIGN IN
SIGN UP
On the occur-check-free PROLOG programs
Full Text:
PDF
Buy this Article
Authors:
Krzysztof R. Apt
CWI, Amsterdam, The Netherlands; Univ. of Amsterdam, The Netherlands
Alessandro Pellegrini
Univ. di Padova, Padova, Italy
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 16 Issue 3, May 1994
Pages 687-726
ACM
New York, NY
, USA
table of contents
doi>
10.1145/177492.177673
1994 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 269
· Citation Count: 17
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
correctness proofs
languages
logic and constraint programming
mechanical theorem proving
moded programs
occur-check problem
preprocessors
prolog
prolog programs
theory
unification algorithm
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder