Introduction to higher order categorical logic
Introduction to higher order categorical logic
Predicate calculus and program semantics
Predicate calculus and program semantics
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Constructing functional programs for grammar analysis problems
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Bottom-up Grammar Analysis - A Functional Formulation
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
| Hi-index | 0.00 |
Many functions on context-free languages can be expressed in the form of the least fixed point of a function whose definition mimics the grammar of the given language. This paper presents the basic theory that explains when a function on a context-free language can be defined in this way. The contributions are: a novel definition of a regular algebra capturing division properties, several theorems showing how complex regular algebras are built from simpler ones, and the application of fixed point theory and Galois connections to practical programming problems.