scientific article
From MaRDI portal
Publication:3721784
zbMath0592.68014MaRDI QIDQ3721784
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
programming languageslinkingcompilationfunctional programmingMirandapolymorphic type systemKRCSASLlibrary structure
Related Items (49)
Extended term rewriting systems ⋮ Generalization of final algebra semantics by relativization ⋮ Categorical semantics for programming languages ⋮ Adapting combinator and SECD machines to display snapshots of functional computations ⋮ A chemical abstract machine for graph reduction extended abstract ⋮ Pattern matching as cut elimination ⋮ GC\(^{2}\): a generational conservative garbage collector for the ATERM library ⋮ Higher-order unification with dependent function types ⋮ Head boundedness of nonterminating rewritings ⋮ Needed reduction and spine strategies for the lambda calculus ⋮ Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs ⋮ Normalization results for typeable rewrite systems ⋮ Full abstraction and limiting completeness in equational languages ⋮ SOS formats and meta-theory: 20 years after ⋮ Wrapper semantics of an object-oriented programming language with state ⋮ First order data types and first order logic ⋮ Strictness and totality analysis with conjunction ⋮ Folding left and right matters: Direct style, accumulators, and continuations ⋮ On the efficiency of categorical combinators as a rewriting system ⋮ A logic for Miranda ⋮ Cyclic reference counting with local mark-scan ⋮ Implementing term rewrite languages in DACTL ⋮ Equational completion in order-sorted algebras ⋮ Semantics of types for database objects ⋮ Relation algebraic domain constructions ⋮ Decidability of bounded higher-order unification ⋮ \(Booster\): A high-level language for portable parallel algorithms ⋮ \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus ⋮ Intersection type assignment systems with higher-order algebraic rewriting ⋮ Complete restrictions of the intersection type discipline ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ Functional Semantics ⋮ Computational interpretations of linear logic ⋮ Universal algebra in higher types ⋮ Graphical and incremental type inference. A graph transformation approach ⋮ Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness ⋮ Transfinite reductions in orthogonal term rewriting systems ⋮ Extensional models for polymorphism ⋮ Miranda ⋮ Functorial polymorphism ⋮ Preliminary arrangements of arguments in lazy evaluation ⋮ An operational semantics for paragon: A design notation for parallel architectures ⋮ More efficient left-to-right matching for overlapping pattern ⋮ Typability and type checking in System F are equivalent and undecidable ⋮ An efficient algorithm for cyclic reference counting. ⋮ Descendants and origins in term rewriting. ⋮ Subset-equational programming in intelligent decision systems ⋮ Comparison of priority rules in pattern matching and term rewriting ⋮ OBSCURE, a specification language for abstract data types
This page was built for publication:
