scientific article
From MaRDI portal
Publication:4023825
zbMath0806.68003MaRDI QIDQ4023825
No author found.
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
modal logicabstract data typesfinite structuresMathematical structuresLogic computer sciencesemantics of a functional programming languagevaluation systems
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modal logic (including the logic of norms) (03B45) Theory of programming languages (68N15) Logic in computer science (03B70) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
On interreduction of semi-complete term rewriting systems, Implementing conditional term rewriting by graph rewriting, Proof by computation in the Coq system, Weak normalization implies strong normalization in a class of non-dependent pure type systems, On the longest perpetual reductions in orthogonal expression reduction systems, \(F\)-semantics for type assignment systems, A constructive approach to nonstandard analysis, On the modularity of termination of term rewriting systems, From realizability to induction via dependent intersection, Modal operators on pseudo-BE algebras, Bridging Curry and Church's typing style, Comparing cubes of typed and type assignment systems, A useful \(\lambda\)-notation, Incremental constraint satisfaction for equational logic programming, Higher-order subtyping and its decidability, Strong normalisation in the \(\pi\)-calculus, An integrated framework for the diagnosis and correction of rule-based programs, Characteristics of de Bruijn’s early proof checker Automath, Lambda calculus with explicit recursion, Higher-order rewrite systems and their confluence, Bubbles in modularity, Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding, Polymorphic syntax definition, Tree algebras and varieties of tree languages, Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters, Lazy narrowing: Strong completeness and eager variable elimination (extended abstract), Monad transformers as monoid transformers, Specification of abstract dynamic-data types: A temporal logic approach, Simple termination of rewrite systems, Strategy based semantics for mobility with time and access permissions, In the Search of a Naive Type Theory, Braids via term rewriting, A linear logical framework, Typed operational semantics for higher-order subtyping., A quantitative approach to reasoning about incomplete knowledge, Levels of undecidability in rewriting, Constraint contextual rewriting., Rewriting-based repairing strategies for XML repositories, Binary decision diagrams for first-order predicate logic., Recursive quasi-metric spaces., Abstract reduction systems and idea of Knuth-Bendix completion algorithm, Multiset rewriting over Fibonacci and tribonacci numbers, A survey of strategies in rule-based program transformation systems, Evaluation strategies for functional logic programming, Decidability of bounded higher-order unification, Formalism and method, Logicality of conditional rewrite systems, Basic notions of universal algebra for language theory and graph grammars, A sequential reduction strategy, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Lazy narrowing: strong completeness and eager variable elimination, Duality beyond sober spaces: Topological spaces and observation frames, A faithful computational model of the real numbers, Modular termination of \(r\)-consistent and left-linear term rewriting systems, The meaning of specifications I: Domains and initial models, Term rewriting and Hoare logic -- Coded rewriting, Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus, Representations of Complete Uniform Spaces via Uniform Domains, A type system for counting instances of software components, Categorical rewriting of term-like structures, Programming with narrowing: a tutorial, Cut Elimination in a Class of Sequent Calculi for Pure Type Systems, Globalization of confluent partial actions on topological and metric spaces, On fuzzy type theory, Regular database update logics, Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem, Objects and their lambda calculus, Typing termination in a higher-order concurrent imperative language, On the computational content of the Lawson topology, Unnamed Item, Simple termination is difficult, On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism, Speed-up theorems in type-2 computations using oracle Turing machines, Meadows and the equational specification of division, De Bruijn's weak diamond property revisited, Operational domain theory and topology of sequential programming languages, Algebraic models of microprocessors architecture and organisation, Reasoning about nondeterministic and concurrent actions: A process algebra approach, A hybrid programming scheme combining fuzzy-logic and functional-logic resources, Evaluation Strategies for Functional Logic Programming, Transformation of Shaped Nested Graphs and Diagrams1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph)., Certifying Term Rewriting Proofs in ELAN, Timed Term Rewrite Systems, Defining Actions in Concurrent Declarative Programming, On normalizing, non-terminating one-rule string rewriting systems, The universal exponentiable arrow, Reducibility, Strong normalization property for second order linear logic, Vivid: a framework for heterogeneous problem solving, Typability and type checking in System F are equivalent and undecidable, On \(\Pi\)-conversion in the \(\lambda\)-cube and the combination with abbreviations, Skew confluence and the lambda calculus with letrec, The constructive maximal point space and partial metrizability, Bisimilarity in term graph rewriting., The combinator S, Integration in Real PCF, Perpetuality and uniform normalization in orthogonal rewrite systems, The conflict-free reduction geometry, Nominal Equational Logic, Combinatory reduction systems: Introduction and survey, Extension of valuations on locally compact sober spaces, Modularity of confluence: A simplified proof, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Confluence by decreasing diagrams, Theory revision with queries: Horn, read-once, and parity formulas
