scientific article; zbMATH DE number 3951980
From MaRDI portal
Publication:3721784
zbMATH Open0592.68014MaRDI QIDQ3721784FDOQ3721784
Authors:
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
compilationfunctional programmingprogramming languageslinkingMirandapolymorphic type systemKRCSASLlibrary structure
Cited In (55)
- More efficient left-to-right matching for overlapping pattern
- Wrapper semantics of an object-oriented programming language with state
- Strictness and totality analysis with conjunction
- Functional semantics
- Complete restrictions of the intersection type discipline
- Universal algebra in higher types
- Title not available (Why is that?)
- SOS formats and meta-theory: 20 years after
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Computational interpretations of linear logic
- Transfinite reductions in orthogonal term rewriting systems
- Retrieving library identifiers via equational matching of types
- Extensional models for polymorphism
- The application of the functional programming language \textit{Miranda} in the enumeration algorithms of \(k\)-optimal paths
- Full abstraction and limiting completeness in equational languages
- Head boundedness of nonterminating rewritings
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Typability and type checking in System F are equivalent and undecidable
- An efficient algorithm for cyclic reference counting.
- Generalization of final algebra semantics by relativization
- A chemical abstract machine for graph reduction extended abstract
- First order data types and first order logic
- Relation algebraic domain constructions
- Intersection type assignment systems with higher-order algebraic rewriting
- Miranda
- An operational semantics for paragon: A design notation for parallel architectures
- Preliminary arrangements of arguments in lazy evaluation
- Decidability of bounded higher-order unification
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
- \(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
- Implementing term rewrite languages in DACTL
- Semantics of types for database objects
- OBSCURE, a specification language for abstract data types
- Extended term rewriting systems
- Categorical semantics for programming languages
- On the efficiency of categorical combinators as a rewriting system
- Higher-order unification with dependent function types
- Subset-equational programming in intelligent decision systems
- Comparison of priority rules in pattern matching and term rewriting
- Needed reduction and spine strategies for the lambda calculus
- GC\(^{2}\): a generational conservative garbage collector for the ATERM library
- Normalization results for typeable rewrite systems
- A logic for Miranda, revisited
- Descendants and origins in term rewriting.
- Adapting combinator and SECD machines to display snapshots of functional computations
- Graphical and incremental type inference. A graph transformation approach
- Functorial polymorphism
- Semantics of non-terminating rewrite systems using minimal coverings
- Describing and animating quantum protocols
- Folding left and right matters: Direct style, accumulators, and continuations
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 Q3721784)
