Author:
Rydeheard D. E.,Stell J. G.
Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. Burstall R.M. (1980) Electronic Category Theory. Proc. Ninth Annual Symposium on the Mathematical Foundations of Computer Science. Rydzyua, Poland.
2. Burstall R.M. and Goguen J.A. (1981) An Informal Introduction to Specifications using Clear. In ‘The correctness problem in computer science', Eds. Boyer and Moore. Academic Press, London.
3. Burstall R.M. and Landin P.J. (1969) Programs and Their Proofs: An Algebraic Approach. Machine Intelligence 4. Edinburgh Univ. Press. pp 17–44.
4. Colmerauer A. et al. (1973) Etude et realisation d'un système PROLOG. Convention de Research IRIA-Sesori No. 77030.
5. Eriksson L.H. (1984) Synthesis of a Unification Algorithm in a Logic Programming Calculus. Journal of Logic Programming, 1,1.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Allegories of Symbolic Manipulations;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Relative Full Completeness for Bicategorical Cartesian Closed Structure;Lecture Notes in Computer Science;2020
3. Finite Limits and Anti-unification in Substitution Categories;Recent Trends in Algebraic Development Techniques;2019
4. Functorial Semantics of Rewrite Theories;Formal Methods in Software and Systems Modeling;2005
5. Deriving Weak Bisimulation Congruences from Reduction Systems;Lecture Notes in Computer Science;2005