Systems programming in concurrent prolog
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Pattern driven lazy reduction: A unifying evaluation mechanism for functional and logic programs
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logic enhancement: A method for extending logic programming languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A recursive interpreter for the Icon programming language
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Search direction by goal failure in goal-oriented programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relaxed safeness in Datalog-based policies
RuleML'11 Proceedings of the 5th international conference on Rule-based modeling and computing on the semantic web
| Hi-index | 0.00 |
New control constructs are proposed to replace Prolog's notorious cut. Totality assertions are introduced to enable a language-oriented editor to display the control structure of a procedure. Functional notation is presented as a syntactic extension. Data flow assertions are proposed to assert data flow properties and restrictions of logic procedures. Algorithms for their verification are given.