The following pages link to Miranda (Q17133):
Displayed 50 items.
- Graphical and incremental type inference. A graph transformation approach (Q526459) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- The lazy z-buffer (Q672396) (← links)
- Mapping a functional notation for parallel programs onto hypercubes (Q674270) (← links)
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Functorial polymorphism (Q753948) (← links)
- Preliminary arrangements of arguments in lazy evaluation (Q756403) (← links)
- An operational semantics for paragon: A design notation for parallel architectures (Q756433) (← links)
- Formal specification of topological subdivisions using hypermaps (Q805200) (← links)
- Subset-equational programming in intelligent decision systems (Q805225) (← links)
- Comparison of priority rules in pattern matching and term rewriting (Q808264) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Issues in the design of a parallel object-oriented language (Q909434) (← links)
- A logic for Miranda (Q909443) (← links)
- Cyclic reference counting with local mark-scan (Q910204) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- Deforestation: Transforming programs to eliminate trees (Q914358) (← links)
- Semantics of types for database objects (Q915443) (← links)
- Lawful functions and program verification in miranda (Q918222) (← links)
- Defining, analysing and implementing communication protocols using attribute grammars (Q919803) (← links)
- A functional model of a simplified sequential machine (Q919809) (← links)
- Adapting combinator and SECD machines to display snapshots of functional computations (Q1082792) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs (Q1098614) (← links)
- Automatic binding time analysis for a typed \(\lambda\)-calculus (Q1107512) (← links)
- Implementing first-order rewriting with constructor systems (Q1112601) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Relation algebraic domain constructions (Q1177156) (← links)
- PROOF: A parallel object-oriented functional computation model (Q1177281) (← links)
- \(Booster\): A high-level language for portable parallel algorithms (Q1181513) (← links)
- Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers (Q1183550) (← links)
- \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus (Q1186104) (← links)
- Parallel programming with data structures and higher order functions (Q1190848) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- Universal algebra in higher types (Q1199827) (← links)
- Full abstraction in the lazy lambda calculus (Q1261291) (← links)
- A note on higher-order functions versus logical variables (Q1262113) (← links)
- Using lazy evaluation to simulate realistic-size repertoires in models of the immune system (Q1289551) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- OBSCURE, a specification language for abstract data types (Q1323328) (← links)
- Sequential and data flow models of processing (Q1324396) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Axioms for strict and lazy functional programs (Q1772783) (← links)
- Linear-time hierarchies for a functional language machine model (Q1818323) (← links)
- Generating function versions with rational strictness patterns (Q1822933) (← links)
- An efficient algorithm for cyclic reference counting. (Q1853056) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)