Miranda

swMATH4986MaRDI QIDQ17133

No author found.

Related Items (only showing first 100 items - show all)

Generalization of final algebra semantics by relativization ⋮ Categorical semantics for programming languages ⋮ A chemical abstract machine for graph reduction extended abstract ⋮ Unnamed Item ⋮ Higher-order unification with dependent function types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Categories, relations and dynamic programming ⋮ Unnamed Item ⋮ The integration of functions into logic programming: From theory to practice ⋮ Unnamed Item ⋮ An approach to object semantics based on terminal co-algebras ⋮ Domain Decomposition and Schur Complement Approaches to Coupling the Well Equations in Reservoir Simulation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Normal-order reduction grammars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The resource constrained shortest path problem implemented in a lazy functional language ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Functional Semantics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Improving federated database queries using declarative rewrite rules for quantified subqueries ⋮ List processing primitives for parallel computation ⋮ Unnamed Item ⋮ Transfinite reductions in orthogonal term rewriting systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Processes, Terms and Cycles: Steps on the Road to Infinity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Representational and denotational semantics of digital systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A study of sparse matrix representations for solving linear systems in a functional language ⋮ Quantifier elimination and parametric polymorphism in programming languages ⋮ The complexity of type inference for higher-order typed lambda calculi ⋮ A domain-theoretic approach to functional and logic programming ⋮ Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages ⋮ Dynamic tabbing for automatic indentation with the layout rule ⋮ Adapting combinator and SECD machines to display snapshots of functional computations ⋮ Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs ⋮ Pattern matching as cut elimination ⋮ GC\(^{2}\): a generational conservative garbage collector for the ATERM library ⋮ Transfinite reductions in orthogonal term rewriting systems ⋮ Head boundedness of nonterminating rewritings ⋮ Efficient graph rewriting and its implementation ⋮ Needed reduction and spine strategies for the lambda calculus ⋮ Towards the Formal Specification and Verification of Maple Programs ⋮ Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs ⋮ Normalization results for typeable rewrite systems ⋮ Principal types and unification for simple intersection type systems ⋮ Logic programming with functions and predicates: The language Babel ⋮ A logic for Miranda, revisited ⋮ Automatic binding time analysis for a typed \(\lambda\)-calculus ⋮ Implementing first-order rewriting with constructor systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Full abstraction and limiting completeness in equational languages ⋮ SOS formats and meta-theory: 20 years after ⋮ Normal forms and conservative extension properties for query languages over collection types ⋮ Unnamed Item ⋮ Constructing Programs as Executable Attribute Grammars ⋮ The Implementation of FDL, a Functional Database Language ⋮ Unnamed Item ⋮ On the efficiency of categorical combinators as a rewriting system ⋮ Issues in the design of a parallel object-oriented language ⋮ A logic for Miranda ⋮ Cyclic reference counting with local mark-scan ⋮ Equational completion in order-sorted algebras ⋮ Logic and Computation ⋮ Deforestation: Transforming programs to eliminate trees ⋮ Semantics of types for database objects ⋮ Lawful functions and program verification in miranda ⋮ Defining, analysing and implementing communication protocols using attribute grammars ⋮ A functional model of a simplified sequential machine ⋮ Unnamed Item ⋮ Relation algebraic domain constructions ⋮ PROOF: A parallel object-oriented functional computation model ⋮ Decidability of bounded higher-order unification ⋮ Building a model of a useful Turing machine ⋮ \(Booster\): A high-level language for portable parallel algorithms ⋮ Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers ⋮ Programming by Numbers: A Programming Method for Novices ⋮ \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus ⋮ The lazy z-buffer ⋮ Mapping a functional notation for parallel programs onto hypercubes

This page was built for software: Miranda