@article{CTGDC_1991__32_3_203_0, author = {Latch, Dana May}, title = {The connection between the fundamental groupoid and a unification algorithm for syntactil algebras (extended abstract)}, journal = {Cahiers de Topologie et G\'eom\'etrie Diff\'erentielle Cat\'egoriques}, pages = {203--242}, publisher = {Dunod \'editeur, publi\'e avec le concours du CNRS}, volume = {32}, number = {3}, year = {1991}, mrnumber = {1158109}, zbl = {0768.68084}, language = {en}, url = {http://www.numdam.org/item/CTGDC_1991__32_3_203_0/} }
TY - JOUR AU - Latch, Dana May TI - The connection between the fundamental groupoid and a unification algorithm for syntactil algebras (extended abstract) JO - Cahiers de Topologie et Géométrie Différentielle Catégoriques PY - 1991 SP - 203 EP - 242 VL - 32 IS - 3 PB - Dunod éditeur, publié avec le concours du CNRS UR - http://www.numdam.org/item/CTGDC_1991__32_3_203_0/ LA - en ID - CTGDC_1991__32_3_203_0 ER -
%0 Journal Article %A Latch, Dana May %T The connection between the fundamental groupoid and a unification algorithm for syntactil algebras (extended abstract) %J Cahiers de Topologie et Géométrie Différentielle Catégoriques %D 1991 %P 203-242 %V 32 %N 3 %I Dunod éditeur, publié avec le concours du CNRS %U http://www.numdam.org/item/CTGDC_1991__32_3_203_0/ %G en %F CTGDC_1991__32_3_203_0
Latch, Dana May. The connection between the fundamental groupoid and a unification algorithm for syntactil algebras (extended abstract). Cahiers de Topologie et Géométrie Différentielle Catégoriques, Volume 32 (1991) no. 3, pp. 203-242. http://www.numdam.org/item/CTGDC_1991__32_3_203_0/
Baa89 Unification properties of commutative theories: A categorical approach, Proceedings of Category Theory and Computer Science, Manchester, UK, September 1989, LNCS 389, Springer Verlag, New York, 1989, 273-299. | MR
,BaDe87 Completion for rewriting modulo a congruence, Proceedings of Rewriting Techniques and Applications, Bordeaux, France, May 1987, LNCS 256, Springer Verlag, New York, 1987, 192-203. | MR | Zbl
& ,Ba78 Can programming be liberated from the von Neumann style? A functional style and its algebra of programs, Communications of the ACM, 21(1978) 613-641. | MR | Zbl
,Be75The basic algebraic structures in categories of derivations, Infor. and Contr., 28(1975) 1-29. | MR | Zbl
,BiWa88 Introduction to Functional Programming, Prentice Hall, New York, 1988.
& ,BHS89On equational theories, unification and (un)decidability, J. Symbolic Computation, 8(1989) 3-49. | MR | Zbl
, &BuRy86 The unification of terms: A category-theoretic algorithm, Proceedings of Category Theory and Computer Programming, Guildford, UK, Sept. 1985, LNCS 240, Springer Verlag, New York, 1986, 493-505. | MR | Zbl
& ,Co65 Universal Algebra, Harper & Row, New York, 1965. | MR | Zbl
,DaWe83 Computability, Complexity and Languages, Academic Press, New York, 1983. | MR | Zbl
& ,D2Qu78 Machines, Languages and Computation, Prentice-Hall, Englewood Cliffs, NJ, 1978. | Zbl
, & ,Ei87 Functional Programming: Languages, Tools and Architectures, John Wiley & Sons, New York, 1987.
,Fa84 Associative-commutative unification, Proceedings of the 7th C.A.D.E., LNCS 170, Springer Verlag, New York, 1984, 194-208. | MR | Zbl
,Fr79 Virtual Memory Systems for Closed Applicative Language Interpreters, PhD Dissertation, University of North Carolina at Chapel Hill, 1979.
,FLPS82 Applications of algebraic topology of small categories to the semantics of formal functional programming languages, UNC-CH Technical Report in Computer Science #82-009, Chapel Hill, NC, 1982.
, , & ,FriLa81 Homotopy inverses for nerve, Math. Z., 177(1981) 147-179. | MR | Zbl
& ,GaZi67 Calculus of Fractions and Homotopy Theory, Springer Verlag, New York, 1967. | MR | Zbl
& ,Gi66 Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. | MR | Zbl
,Ha78 Introduction to Formal Language Theory Addison-Wesley, Reading, MA, 1978. | MR | Zbl
,HaW385 Denotational semantics and rewrite rules for FP, Proceedings of the Twelfth ACM Symposium of Principles of Programming Languages, January 1985, 108-120.
, , , & ,HoU179 Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979. | MR | Zbl
& ,Hu89 The conception, evolution and application of functional programming languages, to appear in ACM Computing Surveys.
,Hue75A unification algorithm for the typed λ-calculus, Theor. Comp. Sci., 1(1975) 25-57. | Zbl
,Hue80Confluent reductions: abstract properties and applications to term rewriting systems, J. of Assoc. Comp. Mach., 27(1980) 797-821. | MR | Zbl
,Kn89 Unification: A multidisciplinary survey, ACM Computing Surveys, 21(1989) 93-124. | MR | Zbl
,KnBe70 Simple word problems in universal algebras, Computational Problems in Abstract Algebra, Leech J., ed., Pergamon Press, 1970, 263-297. | MR | Zbl
& ,LaSc86 Introduction to Higher Order Categorical Logic, Cambridge University Press, London, 1986. | MR | Zbl
& ,La73On derived functors of limit, Trans. of Amer. Math. Soc., 181(1973) 155-163. | MR | Zbl
,La75The uniqueness of homology for the category of small categories, J. of Pure and Applied Algebra, 9(1975) 221-237. | MR | Zbl
,La79A fibred homotopy equivalence and homology theories for the category of small categories, J. of Pure and Applied Algebra, 15(1979) 247-269. | MR | Zbl
,La89aFinite generation of ambiguity in context free languages, J. of Pure and Applied Algebra, 57(1989) 229-263. | MR | Zbl
,La89b An application of minimal context-free intersection partitions to rewrite rule consistency checking, Proceedings of the AMS-IMS-SIAM Conference on Categories in Computer Science and Logic, Boulder CO, 1987, AMS Contemporary Mathematics, 92(1989) 241 -260. | MR | Zbl
,LaMi74On the difference between homological and cohomological dimensions, J. of Pure and Applied Algebra, 5(1974) 333-343. | MR | Zbl
& ,LaSi88 Generating evaluation theorems for functional programming languages, Proceedings of the Third International Symposium on Methodologies for Intelligent Systems, Torino, Italy, October 1988, 47-58.
& ,LSR90 Generating nondeterministic evaluation theorems for functional languages, to appear in Proceedings of the Fourth Workshop on Computer Science Logic, Heidelberg, FRG, October 1990.
, & ,LTW79Simplicial sets from categories, Math. Z., 164(1979) 195-214. | MR | Zbl
, & ,LePa81 Elements of the Theory of Computation, Prentice Hall, Englewood Cliffs, NJ., 1981. | Zbl
& ,Mac71 Categories for the Working Mathematician, Springer Verlag, New York, 1971. | MR | Zbl
,Mi57The geometric realization of a semi-simplicial complex, Ann. Math., 65(1957), 357-362. | MR | Zbl
,Ne80Categorical and topological aspects of formal languages, Math. System Theory 13(1980) 255-273. | MR | Zbl
,Ro65A machine-oriented logic based on the resolution principle, J. of Assoc. for Comp. Mach., 12(1965) 23-41. | MR | Zbl
,Rot88 An Introduction to Algebraic Topology, Springer Verlag, New York, 1988. | MR | Zbl
,Ru87An algebraic model for programming languages, Computer Languages 12(1987) 173-195. | Zbl
,RySt87 Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms, Proceedings of Category Theory and Computer Science, Edinburgh, UK, September 1987, LNCS 389, Springer Verlag, New York, 1987, 114-139. | MR | Zbl
& ,ShSt87 The Art of PROLOG, MIT Press, Cambridge, MA, 1987. | Zbl
& ,Si84 Universal unification, Proceedings of the 7th C.A.D.E., LNCS 170, Springer Verlag, New York, 1984, 1-42. | MR | Zbl
,Si89 Unification theory, J. Symbolic Computation, 7(1989) 207-274. | MR | Zbl
,