Miranda
From MaRDI portal
swMATH4986MaRDI QIDQ17133FDOQ17133
Author name not available (Why is that?)
Official website: http://miranda.org.uk/
Cited In (only showing first 100 items - show all)
- Orthogonal parallel processing in Vector Pascal
- More efficient left-to-right matching for overlapping pattern
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards the formal specification and verification of Maple programs
- Functional semantics
- A note on higher-order functions versus logical variables
- Title not available (Why is that?)
- Full abstraction and limiting completeness in equational languages
- Head boundedness of nonterminating rewritings
- Efficient graph rewriting and its implementation
- Title not available (Why is that?)
- An efficient algorithm for cyclic reference counting.
- A domain-theoretic approach to functional and logic programming
- Title not available (Why is that?)
- Axioms for strict and lazy functional programs
- Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequential and data flow models of processing
- Normal forms and conservative extension properties for query languages over collection types
- Decidability of bounded higher-order unification
- \(Booster\): A high-level language for portable parallel algorithms
- Pattern matching as cut elimination
- A logic for Miranda
- Cyclic reference counting with local mark-scan
- Equational completion in order-sorted algebras
- \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus
- Semantics of types for database objects
- Lawful functions and program verification in miranda
- A functional model of a simplified sequential machine
- Title not available (Why is that?)
- Parallel programming with data structures and higher order functions
- Title not available (Why is that?)
- Linear-time hierarchies for a functional language machine model
- Generating function versions with rational strictness patterns
- Categorical semantics for programming languages
- On the efficiency of categorical combinators as a rewriting system
- Prototyping SOS meta-theory in Maude
- Subset-equational programming in intelligent decision systems
- Comparison of priority rules in pattern matching and term rewriting
- List processing primitives for parallel computation
- Constructing Programs as Executable Attribute Grammars
- Normal-order reduction grammars
- Domain Decomposition and Schur Complement Approaches to Coupling the Well Equations in Reservoir Simulation
- Building a model of a useful Turing machine
- A logic for Miranda, revisited
- The Implementation of FDL, a Functional Database Language
- Title not available (Why is that?)
- Adapting combinator and SECD machines to display snapshots of functional computations
- Principal types and unification for simple intersection type systems
- Title not available (Why is that?)
- Implementing first-order rewriting with constructor systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete restrictions of the intersection type discipline
- Universal algebra in higher types
- Formal specification of topological subdivisions using hypermaps
- Interval propagation to reason about sets: Definition and implementation of a practical language
- The complexity of type inference for higher-order typed lambda calculi
- The integration of functions into logic programming: From theory to practice
- Lazy productivity via termination
- SOS formats and meta-theory: 20 years after
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Computational interpretations of linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transfinite reductions in orthogonal term rewriting systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Using lazy evaluation to simulate realistic-size repertoires in models of the immune system
- An approach to object semantics based on terminal co-algebras
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Logic programming with functions and predicates: The language Babel
- Logic and Computation
- Typability and type checking in System F are equivalent and undecidable
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deforestation: Transforming programs to eliminate trees
- Title not available (Why is that?)
- The Theory of Calculi with Explicit Substitutions Revisited
- Defining, analysing and implementing communication protocols using attribute grammars
- Full abstraction in the lazy lambda calculus
- Transfinite reductions in orthogonal term rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relation algebraic domain constructions
- ML
- PROOF
- ISDL
- LETOS
- LISP
- Title not available (Why is that?)
- Alfalfa
- GUM
- iTasks
- Jambox
- Scheme
- Naira
- Sisal
- SmallEiffel
This page was built for software: Miranda