scientific article; zbMATH DE number 3187218
From MaRDI portal
Publication:5723489
Cited in
(21)- On termination problems for finitely interpreted ALGOL-like programs
- PASCAL in LCF: Semantics and examples of proof
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- Improving the lazy Krivine machine
- On the correctness of the Krivine machine
- A run-time mechanism for referencing variables
- A minimalist approach to objects
- The design and implementation of parametric types in Pascal
- Compilation of linear partial differential equations into finite-difference programs
- Testing ALGOL 60 compilers
- A language for inquiring about the run-time behaviour of programs
- A new implementation technique for applicative languages
- Organizing the description of a relational data base
- Possibilities for refining an object program compiled with an ALGOL translator
- Data structure and storage allocation
- The design of a pascal compiler
- Abstract machine modelling to produce portable software—a review and evaluation
- Storage administration in a virtual memory Simula system
- Evalquote in simple Fortran: A tutorial on interpreting Lisp
- Implementing the ALGOL 68 heap
- Computation, hypercomputation, and physical science
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5723489)