Recommendations
Cites work
- scientific article; zbMATH DE number 3976287 (Why is no real title available?)
- scientific article; zbMATH DE number 194259 (Why is no real title available?)
- scientific article; zbMATH DE number 1761878 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- A linear time solution to the single function coarsest partition problem
- Applications of range query theory to relational data base join and selection operations
- Automatic data structure choice in a language of very high level
- Constructive versions of Tarski's fixed point theorems
- Encoding types in ML-like languages
- From regular expressions to DFA's using compressed NFA's
- High level iterators and a method for automatically designing data structure representation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- Modified basic functionality in combinatory logic
- More efficient bottom-up multi-pattern matching in trees
- Optimization of very high level languages—I
- Program derivation by fixed point computation
- The Principal Type-Scheme of an Object in Combinatory Logic
- Transformational design and implementation of a new efficient solution to the ready simulation problem
- Using multiset discrimination to solve language processing problems without hashing
This page was built for publication: An NSF proposal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815007)