On the public citation graph

Multiparadigm logic programming

https://doi.org/10.1007/bfb0013826
0 signed · 105 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-06859-7_148openalex-snapshot
Towards a theory of type structure
inferredcites →https://doi.org/10.1007/3-540-08531-9openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1007/3-540-09541-1_36openalex-snapshot
Some design principles and theory for OBJ-0, a language to express and execute algebraic specifications of programs
inferredcites →https://doi.org/10.1007/3-540-10003-2_61openalex-snapshot
A characterisation of computable data types by means of a finite equational specification method
inferredcites →https://doi.org/10.1007/3-540-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-13346-1_1openalex-snapshot
A kernel language for abstract data types and modules
inferredcites →https://doi.org/10.1007/3-540-15198-2_24openalex-snapshot
Why Horn formulas matter in computer science: Initial structures and generic examples
inferredcites →https://doi.org/10.1007/3-540-15648-8_20openalex-snapshot
Equational logic as a programming language: Abstract
inferredcites →https://doi.org/10.1007/3-540-15975-4_29openalex-snapshot
The categorical abstract machine
inferredcites →https://doi.org/10.1007/3-540-15984-3_328openalex-snapshot
Unification in conditional-equational theories
inferredcites →https://doi.org/10.1007/3-540-50325-0_3openalex-snapshot
Structuring theories on consequence
inferredcites →https://doi.org/10.1007/3-540-54317-1_111openalex-snapshot
Constrained equational deduction
inferredcites →https://doi.org/10.1007/3-540-55160-3_49openalex-snapshot
Parallel programming in maude
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/978-1-4899-0021-0openalex-snapshot
Toposes, Triples and Theories
inferredcites →https://doi.org/10.1007/bfb0014969openalex-snapshot
Models and equality for logical programming
inferredcites →https://doi.org/10.1007/bfb0015747openalex-snapshot
Operational semantics for order-sorted algebra
inferredcites →https://doi.org/10.1007/bfb0038698openalex-snapshot
A logic programming language with lambda-abstraction, function variables, and simple unification
inferredcites →https://doi.org/10.1007/bfb0039072openalex-snapshot
Rewriting as a unified model of concurrency
inferredcites →https://doi.org/10.1007/bfb0061293openalex-snapshot
Completeness theorem for logical categories
inferredcites →https://doi.org/10.1016/0010-4485(78)90044-1openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1016/0168-0072(86)90053-9openalex-snapshot
Generalised algebraic theories and contextual categories
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0304-3975(90)90063-nopenalex-snapshot
Conditional equational theories and complete sets of transformations
inferredcites →https://doi.org/10.1016/0304-3975(90)90064-oopenalex-snapshot
A rationale for conditional equational programming
inferredcites →https://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
inferredcites →https://doi.org/10.1016/0304-3975(92)90302-vopenalex-snapshot
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
inferredcites →https://doi.org/10.1016/0743-1066(84)90003-7openalex-snapshot
Oriented equational clauses as a programming language
inferredcites →https://doi.org/10.1016/0743-1066(84)90004-9openalex-snapshot
Equality, types, modules, and (why not?) generics for logic programming
inferredcites →https://doi.org/10.1016/0890-5401(90)90013-8openalex-snapshot
Petri nets are monoids
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/b978-0-934613-63-7.50046-2openalex-snapshot
Object-Oriented Concurrent Programming in ABCL/1
inferredcites →https://doi.org/10.1016/s0019-9958(86)80047-xopenalex-snapshot
Categorical combinators
inferredcites →https://doi.org/10.1016/s0049-237x(08)70132-0openalex-snapshot
General Logics
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
inferredcites →https://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
inferredcites →https://doi.org/10.1016/s0747-7171(89)80036-7openalex-snapshot
Order-sorted unification
inferredcites →https://doi.org/10.1017/s0305004100061284openalex-snapshot
Locally cartesian closed categories and type theory
inferredcites →https://doi.org/10.1090/conm/092/1003197openalex-snapshot
Towards a geometry of interaction
inferredcites →https://doi.org/10.1090/conm/092/1003199openalex-snapshot
The theory of constructions: categorical semantics and topos-theoretic models
inferredcites →https://doi.org/10.1090/pspum/025/0363802openalex-snapshot
Completeness and axiomatizability in many-valued logic
inferredcites →https://doi.org/10.1109/lics.1988.5114openalex-snapshot
Petri nets are monoids: a new algebraic foundation for net theory
inferredcites →https://doi.org/10.1109/lics.1989.39177openalex-snapshot
Structure and representation in LF
inferredcites →https://doi.org/10.1142/s0129054191000182openalex-snapshot
FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
inferredcites →https://doi.org/10.1145/1005937.1005947openalex-snapshot
Logic for problem solving
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/147508.147524openalex-snapshot
Institutions: abstract model theory for specification and programming
inferredcites →https://doi.org/10.1145/318593.318610openalex-snapshot
Principles of OBJ2
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/323648.323755openalex-snapshot
Extensions and foundations of object-oriented programming
inferredcites →https://doi.org/10.1145/357153.357158openalex-snapshot
Programming with Equations
inferredcites →https://doi.org/10.1145/382192.383004openalex-snapshot
Concepts and paradigms of object-oriented programming
inferredcites →https://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferredcites →https://doi.org/10.1145/75277.75297openalex-snapshot
Relating models of polymorphism
inferredcites →https://doi.org/10.1145/83880.84528openalex-snapshot
Concurrent object-oriented programming
inferredcites →https://doi.org/10.1145/96709.96717openalex-snapshot
The chemical abstract machine
inferredcites →https://doi.org/10.1145/97945.97953openalex-snapshot
LO and behold! Concurrent structured processes
inferredcites →https://doi.org/10.1145/97945.97958openalex-snapshot
A logical theory of concurrent objects
inferredcites →https://doi.org/10.21236/ada087640openalex-snapshot
Canonical Forms and Unification.
inferredcites →https://doi.org/10.2307/2273831openalex-snapshot
Categorical semantics for higher order polymorphic lambda calculus
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
inferredcites →https://doi.org/10.7146/dpb.v14i191.7463openalex-snapshot
Galleries and Institutions
inferredcites →https://doi.org/10.7551/mitpress/1086.001.0001openalex-snapshot
Actors
inferredcites →https://doi.org/10.7551/mitpress/2087.003.0017openalex-snapshot
A Logical Theory of Concurrent Objects and Its Realization in the Maude Language

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10720084_7openalex-snapshot
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
inferred← citeshttps://doi.org/10.1007/11549345_33openalex-snapshot
Goals in the Propositional Horn ⊃ Language Are Monotone Boolean Circuits
inferred← citeshttps://doi.org/10.1007/11780274_14openalex-snapshot
From OBJ to Maude and Beyond
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_5openalex-snapshot
A Strong Logic Programming View for Static Embedded Implications
inferred← citeshttps://doi.org/10.1007/3-540-56777-1_25openalex-snapshot
Towards reliable information systems: The KorSo approach
inferred← citeshttps://doi.org/10.1007/3-540-60608-4_41openalex-snapshot
Deductive and object data languages: A quest for integration
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_28openalex-snapshot
Semantics frameworks for a class of modular algebraic nets
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_1openalex-snapshot
José Meseguer: Scientist and Friend Extraordinaire
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_11openalex-snapshot
Two Decades of Maude
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_3openalex-snapshot
Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis
inferred← citeshttps://doi.org/10.1007/978-3-319-99840-4_2openalex-snapshot
Multi-paradigm Programming in Maude
inferred← citeshttps://doi.org/10.1007/978-3-319-99840-4_6openalex-snapshot
Associative Unification and Symbolic Reasoning Modulo Associativity in Maude
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_1openalex-snapshot
Modular Termination of Basic Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_13openalex-snapshot
Symbolic Model Checking of Infinite-State Systems Using Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_31openalex-snapshot
Termination of Narrowing Using Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_16openalex-snapshot
Functional Logic Programming in Maude
inferred← citeshttps://doi.org/10.1007/978-94-017-0464-9_1openalex-snapshot
Rewriting Logic as a Logical and Semantic Framework
inferred← citeshttps://doi.org/10.1007/978-94-017-1317-7_1openalex-snapshot
Action and Change in Rewriting Logic
inferred← citeshttps://doi.org/10.1007/bfb0014422openalex-snapshot
From abstract data types to logical frameworks
inferred← citeshttps://doi.org/10.1007/bfb0014425openalex-snapshot
On the operational semantics of the algebraic and logic programming language LPG
inferred← citeshttps://doi.org/10.1007/bfb0055494openalex-snapshot
The state of change: A survey
inferred← citeshttps://doi.org/10.1016/0165-6074(94)00017-5openalex-snapshot
A survey of languages integrating functional, object-oriented and logic programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.004openalex-snapshot
Narrowing and Rewriting Logic: from Foundations to Applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.037openalex-snapshot
Termination of narrowing revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.013openalex-snapshot
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.009openalex-snapshot
An integrated framework for the diagnosis and correction of rule-based programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00357-7openalex-snapshot
Rewriting logic: roadmap and bibliography
inferred← citeshttps://doi.org/10.1017/s0960129500000694openalex-snapshot
An approach to object semantics based on terminal co-algebras
inferred← citeshttps://doi.org/10.1017/s1471068421000600openalex-snapshot
Symbolic Specialization of Rewriting Logic Theories withPresto
inferred← citeshttps://doi.org/10.1093/jigpal/jzq009openalex-snapshot
Modular termination of basic narrowing and equational unification
inferred← citeshttps://doi.org/10.1093/logcom/exv021openalex-snapshot
From conventional to institution-independent logic programming
inferred← citeshttps://doi.org/10.1145/170035.170057openalex-snapshot
A logical semantics for object-oriented databases
inferred← citeshttps://doi.org/10.1145/170036.170057openalex-snapshot
A logical semantics for object-oriented databases
inferred← citeshttps://doi.org/10.21236/ada300868openalex-snapshot
Object-Oriented Design and Specification.
inferred← citeshttps://doi.org/10.4230/lipics.calco.2015.304openalex-snapshot
Revisiting the Institutional Approach to Herbrand’s Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404050openalex-snapshot
A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types
inferred← citeshttps://doi.org/10.4995/thesis/10251/19251openalex-snapshot
Termination of Narrowing: Automated Proofs and Modularity Properties
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.