An NSF proposal
From MaRDI portal
Publication:815007
DOI10.1007/S10990-005-7009-2zbMATH Open1084.68018OpenAlexW1982980712MaRDI QIDQ815007FDOQ815007
Authors: N. E. Zubov 
Publication date: 8 February 2006
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-005-7009-2
Recommendations
partial evaluationprogram transformationsoftware performancedata structure selectionlanguage translatorssoftware productivity
Cites Work
- Title not available (Why is that?)
- Constructive versions of Tarski's fixed point theorems
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- The Principal Type-Scheme of an Object in Combinatory Logic
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Transformational design and implementation of a new efficient solution to the ready simulation problem
- A linear time solution to the single function coarsest partition problem
- Using multiset discrimination to solve language processing problems without hashing
- Applications of range query theory to relational data base join and selection operations
- From regular expressions to DFA's using compressed NFA's
- High level iterators and a method for automatically designing data structure representation
- More efficient bottom-up multi-pattern matching in trees
- Automatic data structure choice in a language of very high level
- Optimization of very high level languages—I
- Modified basic functionality in combinatory logic
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- Program derivation by fixed point computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Encoding types in ML-like languages
Cited In (1)
Uses Software
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)
