Fusion on languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2028, Issue , 2001, Pages 107-121

  Backhouse, Roland ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FIXED POINT ARITHMETIC;

BASIC THEORY; FIXED POINT THEORY; FIXED POINTS; GALOIS CONNECTION; PROGRAMMING PROBLEM;

CONTEXT FREE LANGUAGES;

EID: 0038631441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45309-1_8     Document Type: Conference Paper

References (17)

1. [AP72] A. V. Aho and T.G. Peterson. A minimum-distance error-correcting parser for context-free languages. SIAM J. Computing, 1:305-312, 1972.
2. [AU72] Alfred V. Aho and Jeffrey D. Ullman. The theory of parsing, translation and compiling, volume 1 of Series in Automatic Computation. Prentice-Hall, 1972.
3. [BC75] R.C. Backhouse and B.A. Carré. Regular algebra applied to path finding problems. Journal of the Institute of Mathematics and its Applications, 15:161-186, 1975.
4. [CC77] Patrick Cousot and Radhia Cousot. Abstract interpretation: A unifed lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California, January 1977.
5. [CC79] Patrick Cousot and Radhia Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, pages 269-282, San Antonio, Texas, January 1979.
6. J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.
7. E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
8. R.P. Dilworth. Non-commutative residuated lattices. Transactions of the American Mathematical Society, 46:426-444, 1939.
9. [DS90] Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Texts and monographs in Computer Science. Springer-Verlag, 1990.
10. [HH86] C.A.R. Hoare and Jifeng He. The weakest prespecification. Fundamenta Informaticae, 9:51-84, 217-252, 1986.
11. [HS64] J. Hartmanis and R.E. Stearns. Pair algebras and their application to au- tomata theory. Information and Control, 7(4):485-507, 1964.
12. [JS94] J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis [a functional formulation ]. In Donald Sannella, editor, Proceedings Programming Languages and Systems, ESOP '94, volume 788 of LNCS, pages 317-332, 1994.
13. [JS95] J. Jeuring and S.D. Swierstra. Constructing functional programs for gram- mar analysis problems. In S. Peyton Jones, editor, Proceedings Functional Programming Languages and Computer Architecture, FPCA 95, June 1995.
14. D.E. Knuth. A generalization of Dijkstra's shortest path algorithm. Information Processing Letters, 6(1):1-5, 1977.
15. Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In Proc. 6th Annual IEEE Symp. on Logic in Computer Science, pages 214-225. IEEE Society Press, 1991.
16. [LS86] J. Lambek and P.J. Scott. Introduction to Higher Order Categorical Logic, volume 7 of Studies in Advanced Mathematics. Cambridge University Press, 1986.
17. Oystein Ore. Galois connexions. Transactions of the American Mathematical Society, 55:493-513, 1944.