On the public citation graph
Models and equality for logical programming
0 signed · 116 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10007-5_41openalex-snapshot
The semantics of clear, a specification language
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/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-3-642-69962-7openalex-snapshot
Fundamentals of Algebraic Specification 1
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_26openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_11openalex-snapshot
Algebras, Theories and Freeness: An Introduction for Computer Scientists
inferredcites →https://doi.org/10.1007/bfb0015747openalex-snapshot
Operational semantics for order-sorted algebra
inferredcites →https://doi.org/10.1016/0003-4843(74)90016-3openalex-snapshot
Axioms for abstract model theory
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/b978-0-12-046371-8.50016-xopenalex-snapshot
Order-Sorted Equational Computation
inferredcites →https://doi.org/10.1145/24714.24719openalex-snapshot
Remarks on remarks on many-sorted equational logic
inferredcites →https://doi.org/10.1145/318593.318623openalex-snapshot
Denotational semantics and rewrite rules for FP
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/323648.323755openalex-snapshot
Extensions and foundations of object-oriented programming
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/j.1096-9942.1995.tb00006.xopenalex-snapshot
Using Dynamic Classes and Role Classes to Model Object Migration
inferred← citeshttps://doi.org/10.1006/jsco.1998.0253openalex-snapshot
A Framework for Operational Equational Specifications with Pre-defined Structures
inferred← citeshttps://doi.org/10.1007/10705424_1openalex-snapshot
Semantics and Types in Functional Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_4openalex-snapshot
Rewriting Logic as a Metalogical Framework
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_5openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_42openalex-snapshot
Hierarchical Constraint Satisfaction Based on Subdefinite Models
inferred← citeshttps://doi.org/10.1007/3-540-47993-7_25openalex-snapshot
Behavioral Compatibility of Self-Typed Theories
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_62openalex-snapshot
An effective method for handling initial algebras
inferred← citeshttps://doi.org/10.1007/3-540-50820-1_38openalex-snapshot
Towards a clean amalgamation of logic programs with external procedures
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_1openalex-snapshot
Processes as data types: Observational semantics and logic
inferred← citeshttps://doi.org/10.1007/3-540-53932-8_53openalex-snapshot
Semantic specifications for the rewrite rule machine
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_101openalex-snapshot
Compiling concurrent rewriting onto the Rewrite Rule Machine
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_13openalex-snapshot
Entities: An institution for dynamic systems
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_12openalex-snapshot
Programming in OBJ and Maude
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_62openalex-snapshot
Algebraic methods in the compositional analysis of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_48openalex-snapshot
An introduction to category-based equational logic
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_44openalex-snapshot
A category-based equational logic semantics to constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_26openalex-snapshot
Membership algebra as a logical framework for equational specification
inferred← citeshttps://doi.org/10.1007/978-1-4757-6541-0_5openalex-snapshot
Semantic Specifications for the Rewrite Rule Machine
inferred← citeshttps://doi.org/10.1007/978-3-030-13838-7_1openalex-snapshot
Proving Program Properties as First-Order Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-030-16202-3openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_17openalex-snapshot
Automatic Generation of Logical Models with AGES
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_27openalex-snapshot
Automatically Proving and Disproving Feasibility Conditions
inferred← citeshttps://doi.org/10.1007/978-3-319-15075-8_10openalex-snapshot
Completeness and Decidability Results for Hybrid(ised) Logics
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-29510-7_1openalex-snapshot
Variant-Based Satisfiability in Initial Algebras
inferred← citeshttps://doi.org/10.1007/978-3-319-44802-2openalex-snapshot
Rewriting Logic and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-44802-2_2openalex-snapshot
Use of Logical Models for Proving Operational Termination in General Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-72044-9_4openalex-snapshot
Asymmetric Combination of Logics is Functorial: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_11openalex-snapshot
Analysis of Rewriting-Based Systems as First-Order Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_18openalex-snapshot
Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
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-642-04164-8_4openalex-snapshot
Order-Sorted Parameterization and Induction
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_16openalex-snapshot
Functional Logic Programming in Maude
inferred← citeshttps://doi.org/10.1007/bf01125549openalex-snapshot
A programming language with an expandable grammar
inferred← citeshttps://doi.org/10.1007/bf02366772openalex-snapshot
Estimating the execution complexity of logical specifications based on context-free grammars
inferred← citeshttps://doi.org/10.1007/bfb0013077openalex-snapshot
Consistency of equational enrichments
inferred← citeshttps://doi.org/10.1007/bfb0014422openalex-snapshot
From abstract data types to logical frameworks
inferred← citeshttps://doi.org/10.1007/bfb0015037openalex-snapshot
An integrated algebraic approach to the specification of data types, processes and objects
inferred← citeshttps://doi.org/10.1007/bfb0052175openalex-snapshot
Roles and dynamic subclasses: A modal logic approach
inferred← citeshttps://doi.org/10.1007/s002360050054openalex-snapshot
Category-based modularisation for equational logic programming
inferred← citeshttps://doi.org/10.1007/s10817-017-9419-3openalex-snapshot
Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories
inferred← citeshttps://doi.org/10.1007/s10817-019-09514-2openalex-snapshot
Using Well-Founded Relations for Proving Operational Termination
inferred← citeshttps://doi.org/10.1007/s10817-020-09542-3openalex-snapshot
The 2D Dependency Pair Framework for Conditional Rewrite Systems—Part II: Advanced Processors and Implementation Techniques
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90052-5openalex-snapshot
Modular algebraic specification of some basic geometrical constructions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90034-fopenalex-snapshot
Equational completion in order-sorted algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90186-jopenalex-snapshot
Observational structures and their logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90290-vopenalex-snapshot
Multimodal logic programming using equational and order-sorted logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90302-vopenalex-snapshot
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90325-aopenalex-snapshot
Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103174openalex-snapshot
Proving semantic properties as first-order satisfiability
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.fss.2012.11.015openalex-snapshot
Institutional semantics for many-valued logics
inferred← citeshttps://doi.org/10.1016/j.ic.2011.06.002openalex-snapshot
Structural induction in institutions
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.005openalex-snapshot
Herbrand theorems in arbitrary institutions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100749openalex-snapshot
Proving and disproving confluence of context-sensitive rewriting
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.09.001openalex-snapshot
Quasi-boolean encodings and conditionals in algebraic specification
inferred← citeshttps://doi.org/10.1016/j.scico.2016.03.001openalex-snapshot
Proof theory for hybrid(ised) logics
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.001openalex-snapshot
Variant-based satisfiability in initial algebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00134-xopenalex-snapshot
Order-sorted model theory for temporal executable specifications
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00164-8openalex-snapshot
Institutions for logic programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00206-6openalex-snapshot
Specification and proof in membership equational logic
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80110-1openalex-snapshot
A rewrite-based type discipline for a subset of computer algebra
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80036-7openalex-snapshot
Order-sorted unification
inferred← citeshttps://doi.org/10.1016/s1567-8326(01)00011-xopenalex-snapshot
A hidden Herbrand theorem: combining the object and logic paradigms
inferred← citeshttps://doi.org/10.1017/s0960129500000517openalex-snapshot
An Oxford survey of order sorted algebra
inferred← citeshttps://doi.org/10.1017/s0960129500000621openalex-snapshot
Completeness of category-based equational deduction
inferred← citeshttps://doi.org/10.1017/s0960129511000430openalex-snapshot
Interpolation for predefined types
inferred← citeshttps://doi.org/10.1017/s0960129599002960openalex-snapshot
Category-based constraint logic
inferred← citeshttps://doi.org/10.1023/a:1008607717635openalex-snapshot
Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages
inferred← citeshttps://doi.org/10.1093/logcom/ext016openalex-snapshot
Quasi-varieties and initial semantics for hybridized institutions
inferred← citeshttps://doi.org/10.1093/logcom/exv021openalex-snapshot
From conventional to institution-independent logic programming
inferred← citeshttps://doi.org/10.1109/32.223807openalex-snapshot
L.0: a truly concurrent executable temporal logic language for protocols
inferred← citeshttps://doi.org/10.1109/empdp.1994.592540openalex-snapshot
A Life-cycle For Parallel And Distributed Systems Based On two Models Of Concurrency
inferred← citeshttps://doi.org/10.1109/iccl.1994.288383openalex-snapshot
A compositional semantics for conditional term rewriting systems
inferred← citeshttps://doi.org/10.1109/icfem.1997.630424openalex-snapshot
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks
inferred← citeshttps://doi.org/10.1145/1013560.1013566openalex-snapshot
Reflective metalogical frameworks
inferred← citeshttps://doi.org/10.23947/2687-1653-2020-20-4-422-429openalex-snapshot
Polynomially computable Σ-specifications of hierarchical models of reacting systems
inferred← citeshttps://doi.org/10.24963/ijcai.2020/710openalex-snapshot
Proving Semantic Properties as First-Order Satisfiability (Extended Abstract)
inferred← citeshttps://doi.org/10.4204/eptcs.200.3openalex-snapshot
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
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.1611.04170openalex-snapshot
Asymmetric combination of logics is functorial: A survey
inferred← citeshttps://doi.org/10.48550/arxiv.1709.05095openalex-snapshot
A Semantic Approach to the Analysis of Rewriting-Based Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1808.04111openalex-snapshot
Proving Program Properties as First-Order Satisfiability
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.7551/mitpress/4298.003.0065openalex-snapshot
On Extra Variables in (Equational) Logic Programming
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.