On the public citation graph
Semantics of algorithmic languages
0 signed · 305 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.1002/malq.19760220148openalex-snapshot
On the Definition of Computable Function of a Real Variable
inferredcites →https://doi.org/10.1002/malq.19790251305openalex-snapshot
Effective Transformations on Probabilistic Data
inferredcites →https://doi.org/10.1002/spe.4380100406openalex-snapshot
Axioms for user‐defined operators
inferredcites →https://doi.org/10.1007/3-540-07389-2_222openalex-snapshot
Relational definition of computer languages
inferredcites →https://doi.org/10.1007/3-540-07407-4_28openalex-snapshot
Potenzkategorien und ihre Anwendung auf den Beweis von Programmeigenschaften
inferredcites →https://doi.org/10.1007/3-540-07410-4_667openalex-snapshot
First order logic as a tool to solve and classify problems
inferredcites →https://doi.org/10.1007/3-540-07854-1_195openalex-snapshot
An algebraic approach to data types, program verification, and program synthesis
inferredcites →https://doi.org/10.1007/3-540-07854-1_198openalex-snapshot
Schemes with recursion on higher types
inferredcites →https://doi.org/10.1007/3-540-07854-1_200openalex-snapshot
A method using a set-theoretical formalism to describe the semantics of programming languages
inferredcites →https://doi.org/10.1007/3-540-07854-1_211openalex-snapshot
Compiler generation using denotational semantics
inferredcites →https://doi.org/10.1007/3-540-07854-1_223openalex-snapshot
Degrees of parallelism in computations
inferredcites →https://doi.org/10.1007/3-540-08342-1_22openalex-snapshot
On the proper treatment or referencing, dereferencing and assignment
inferredcites →https://doi.org/10.1007/3-540-08342-1_3openalex-snapshot
Semantics and proof theory of pascal procedures
inferredcites →https://doi.org/10.1007/3-540-08353-7_124openalex-snapshot
A comparative review of some program verification methods
inferredcites →https://doi.org/10.1007/3-540-08353-7_127openalex-snapshot
A new type of models of computation
inferredcites →https://doi.org/10.1007/3-540-08353-7_128openalex-snapshot
Correctness of mixed computation in ALGOL-like programs
inferredcites →https://doi.org/10.1007/3-540-08353-7_141openalex-snapshot
Semantics of infinite processes using generalized trees
inferredcites →https://doi.org/10.1007/3-540-08353-7_147openalex-snapshot
Formal transformations and the development of programs
inferredcites →https://doi.org/10.1007/3-540-08353-7_149openalex-snapshot
The expressive power of intensional logic in the semantics of programming languages
inferredcites →https://doi.org/10.1007/3-540-08353-7_161openalex-snapshot
A calculus to build up correct programs
inferredcites →https://doi.org/10.1007/3-540-08442-8_100openalex-snapshot
Fixed-Points and Algebras with Infinitely Long Expressions, II
inferredcites →https://doi.org/10.1007/3-540-08442-8_113openalex-snapshot
On Finite and Infinite Computations
inferredcites →https://doi.org/10.1007/3-540-08442-8_74openalex-snapshot
Algebraic Semantics of Type Definitions and Structured Variables
inferredcites →https://doi.org/10.1007/3-540-08442-8_76openalex-snapshot
Vectors of Coroutines over Blikle Nets
inferredcites →https://doi.org/10.1007/3-540-08442-8_77openalex-snapshot
Initial Algebraic Semantics for Non Context-Free Languages
inferredcites →https://doi.org/10.1007/3-540-08442-8_85openalex-snapshot
Algebras of Partial Sequences — A Tool to Deal with Concurrency
inferredcites →https://doi.org/10.1007/3-540-08446-0_34openalex-snapshot
Semantics of floating point arithmetic and elementary functions
inferredcites →https://doi.org/10.1007/3-540-08921-7_53openalex-snapshot
The algebraic semantics of recursive program schemes
inferredcites →https://doi.org/10.1007/3-540-08921-7_57openalex-snapshot
Synthesis of communicating behaviour
inferredcites →https://doi.org/10.1007/3-540-08921-7_58openalex-snapshot
Programming languages as mathematical objects
inferredcites →https://doi.org/10.1007/3-540-08921-7_64openalex-snapshot
Extensions and implementations of abstract data type specifications
inferredcites →https://doi.org/10.1007/3-540-08921-7_74openalex-snapshot
Goal-oriented derivation of logic programs
inferredcites →https://doi.org/10.1007/3-540-08921-7_75openalex-snapshot
Transforming recursion equations to algorithms
inferredcites →https://doi.org/10.1007/3-540-08921-7_96openalex-snapshot
Ensuring correctness by arbitrary postfixed-points
inferredcites →https://doi.org/10.1007/3-540-09118-1_10openalex-snapshot
A new recursion induction principle
inferredcites →https://doi.org/10.1007/3-540-09118-1_19openalex-snapshot
When are two effectively given domains identical?
inferredcites →https://doi.org/10.1007/3-540-09118-1_3openalex-snapshot
Can partial correctness assertions specify programming language semantics?
inferredcites →https://doi.org/10.1007/3-540-09510-1_15openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.1007/3-540-09510-1_20openalex-snapshot
Recursion schemes and generalized interpretations
inferredcites →https://doi.org/10.1007/3-540-09510-1_3openalex-snapshot
A characterization of abstract data as model-theoretic invariants
inferredcites →https://doi.org/10.1007/3-540-09510-1_43openalex-snapshot
An axiomatic treatment of ALGOL 68 routines
inferredcites →https://doi.org/10.1007/3-540-09510-1_45openalex-snapshot
Constructing call-by-value continuation semantics
inferredcites →https://doi.org/10.1007/3-540-09510-1_48openalex-snapshot
More on advice on structuring compilers and proving them correct
inferredcites →https://doi.org/10.1007/3-540-09510-1_50openalex-snapshot
Unique fixed points vs. least fixed points
inferredcites →https://doi.org/10.1007/3-540-09510-1_7openalex-snapshot
Existential quantifiers in abstract data types
inferredcites →https://doi.org/10.1007/3-540-09526-8_17openalex-snapshot
Completeness problems in verification of programs and program schemes
inferredcites →https://doi.org/10.1007/3-540-09526-8_20openalex-snapshot
Program equivalence and provability
inferredcites →https://doi.org/10.1007/3-540-09526-8_53openalex-snapshot
An algebraic approach to concurrence
inferredcites →https://doi.org/10.1007/3-540-09526-8_56openalex-snapshot
A survey of some syntactic results in the λ-calculus
inferredcites →https://doi.org/10.1007/3-540-09526-8_57openalex-snapshot
On rational expressions representing infinite rational trees : Application to the structure of flow charts
inferredcites →https://doi.org/10.1007/3-540-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-09541-1_21openalex-snapshot
On the abstract specification and formal analysis of synchronization properties of concurrent systems
inferredcites →https://doi.org/10.1007/3-540-09541-1_24openalex-snapshot
Nondeterminism, parallelism and intermittent assertions
inferredcites →https://doi.org/10.1007/3-540-09541-1_30openalex-snapshot
A calculus for proving properties of while-programs
inferredcites →https://doi.org/10.1007/3-540-09541-1_31openalex-snapshot
"E-correctness" of a set of "computation processes"
inferredcites →https://doi.org/10.1007/3-540-09541-1_32openalex-snapshot
Program synthesis through Gödel's interpretation
inferredcites →https://doi.org/10.1007/3-540-09541-1_33openalex-snapshot
The vienna development method (VDM)
inferredcites →https://doi.org/10.1007/3-540-09541-1_37openalex-snapshot
The specification and proof of correctness of interactive programs
inferredcites →https://doi.org/10.1007/3-540-09981-6_10openalex-snapshot
A relational model for non-deterministic programs and predicate transformers
inferredcites →https://doi.org/10.1007/3-540-09981-6_20openalex-snapshot
A model-theoretic approach to specification, extension, and implementation
inferredcites →https://doi.org/10.1007/3-540-09981-6_21openalex-snapshot
Échappements et continuations en semantique dénotationnelle
inferredcites →https://doi.org/10.1007/3-540-09981-6_22openalex-snapshot
Suggestions for composing and specifying program design decisions
inferredcites →https://doi.org/10.1007/3-540-09981-6_4openalex-snapshot
Towards a theory of abstract data types: A discussion on problems and tools
inferredcites →https://doi.org/10.1007/3-540-09981-6_5openalex-snapshot
On relations between programs
inferredcites →https://doi.org/10.1007/3-540-10003-2_102openalex-snapshot
Computability in categories
inferredcites →https://doi.org/10.1007/3-540-10003-2_59openalex-snapshot
Semantics of unbounded nondeterminism
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-10003-2_65openalex-snapshot
Semantic analysis of communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-10003-2_67openalex-snapshot
Algebraic implementation of abstract data types: concept, syntax, semantics and correctness
inferredcites →https://doi.org/10.1007/3-540-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.1007/3-540-10003-2_80openalex-snapshot
Terminal algebra semantics and retractions for abstract data types
inferredcites →https://doi.org/10.1007/3-540-10003-2_84openalex-snapshot
Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions
inferredcites →https://doi.org/10.1007/3-540-10003-2_87openalex-snapshot
Semantics :Algebras,fixed points,axioms
inferredcites →https://doi.org/10.1007/3-540-10003-2_91openalex-snapshot
A constructive approach to compiler correctness
inferredcites →https://doi.org/10.1007/3-540-10007-5_35openalex-snapshot
Foundations of denotational semantics
inferredcites →https://doi.org/10.1007/3-540-10007-5_36openalex-snapshot
Models of programming language concepts
inferredcites →https://doi.org/10.1007/3-540-10007-5_38openalex-snapshot
Experiments in block-structured GOTO language modeling: — EXITs versus continuations
inferredcites →https://doi.org/10.1007/3-540-10007-5_40openalex-snapshot
Time sequences as a tool for describing program behaviour
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-10007-5_42openalex-snapshot
An example of hierarchical program specification
inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/3-540-10009-1_4openalex-snapshot
Proofs as descriptions of computation
inferredcites →https://doi.org/10.1007/3-540-10009-1_5openalex-snapshot
Program synthesis from incomplete specifications
inferredcites →https://doi.org/10.1007/3-540-10250-7_23openalex-snapshot
A constructive approach to compiler correctness
inferredcites →https://doi.org/10.1007/3-540-10250-7_24openalex-snapshot
Using category theory to design implicit conversions and generic operators
inferredcites →https://doi.org/10.1007/3-540-10250-7_33openalex-snapshot
Semantic definitions in REFAL and automatic production of compilers
inferredcites →https://doi.org/10.1007/3-540-10250-7_34openalex-snapshot
On the formal definition of ADA
inferredcites →https://doi.org/10.1007/3-540-10283-3_3openalex-snapshot
A formal semantics definition of sequential Ada
inferredcites →https://doi.org/10.1007/3-540-10856-4_125openalex-snapshot
Constructive category theory (No. 1)
inferredcites →https://doi.org/10.1007/3-540-10856-4_93openalex-snapshot
On realization and implementation
inferredcites →https://doi.org/10.1007/3-540-11157-3_27openalex-snapshot
What are the gains of the theory of algorithms
inferredcites →https://doi.org/10.1007/3-540-11157-3_30openalex-snapshot
The logical approach to programming
inferredcites →https://doi.org/10.1007/978-1-4612-5979-4_5openalex-snapshot
Remarks on the Impact of Program Verification on Language Design
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-67838-7_17openalex-snapshot
Konstruktive Abstrakte Datentypen
inferredcites →https://doi.org/10.1007/978-3-642-95289-0_10openalex-snapshot
Program Proving: Exit and Return Jumps in Structured Programs
inferredcites →https://doi.org/10.1007/978-3-642-95289-0_9openalex-snapshot
How Program Statements Transform Predicates
inferredcites →https://doi.org/10.1007/978-3-662-11106-2_4openalex-snapshot
Formal Models of Parallel Computations
inferredcites →https://doi.org/10.1007/978-94-011-1793-7_2openalex-snapshot
Towards a Mathematical Science of Computation
inferredcites →https://doi.org/10.1007/bf00260921openalex-snapshot
Proof rules for the programming language Euclid
inferredcites →https://doi.org/10.1007/bf00264015openalex-snapshot
Formal derivation of strongly correct concurrent programs
inferredcites →https://doi.org/10.1007/bf00264318openalex-snapshot
On removing the machine from the language
inferredcites →https://doi.org/10.1007/bf00264469openalex-snapshot
LAR: A logic of algorithmic reasoning
inferredcites →https://doi.org/10.1007/bf00268496openalex-snapshot
SEMANOL (73) a metalanguage for programming the semantics of programming languages
inferredcites →https://doi.org/10.1007/bf00269810openalex-snapshot
Language design methods based on semantic principles: Algol 68, a Language Designed using Semantic Principles
inferredcites →https://doi.org/10.1007/bf00288541openalex-snapshot
Hierarchical program specification and verification ? a many-sorted logical approach
inferredcites →https://doi.org/10.1007/bf00289244openalex-snapshot
On an equivalence between continuation and stack semantics
inferredcites →https://doi.org/10.1007/bf00995500openalex-snapshot
A class of functions synthesized from a finite number of examples and a lisp program scheme
inferredcites →https://doi.org/10.1007/bf00995809openalex-snapshot
Formalization of correctness of recursive definitions
inferredcites →https://doi.org/10.1007/bf01068969openalex-snapshot
Analysis and synthesis of structured parallel programs
inferredcites →https://doi.org/10.1007/bf01069324openalex-snapshot
Incompleteness theorem of formal theories from programmer's viewpoint
inferredcites →https://doi.org/10.1007/bf01074230openalex-snapshot
Equivalence of translation relations
inferredcites →https://doi.org/10.1007/bf01075087openalex-snapshot
Parallel programming with types of control
inferredcites →https://doi.org/10.1007/bf01207123openalex-snapshot
A method for proving the correctness of programs
inferredcites →https://doi.org/10.1007/bf01404107openalex-snapshot
Closed categories and the theory of proofs
inferredcites →https://doi.org/10.1007/bf01744285openalex-snapshot
An order-algebraic definition of knuthian semantics
inferredcites →https://doi.org/10.1007/bf01744297openalex-snapshot
Formal computations of non deterministic recursive program schemes
inferredcites →https://doi.org/10.1007/bf01752403openalex-snapshot
Transformations of structures: An algebraic approach
inferredcites →https://doi.org/10.1007/bf01876321openalex-snapshot
Expressibility of functions in D. Scott's LCF language
inferredcites →https://doi.org/10.1007/bf01940782openalex-snapshot
An axiomatic basis for proving total correctness of goto-programs
inferredcites →https://doi.org/10.1007/bf02018415openalex-snapshot
Rekursive Funktionen in der Komputertheorie
inferredcites →https://doi.org/10.1007/bf02219096openalex-snapshot
Computable functionals of finite types
inferredcites →https://doi.org/10.1007/bfb0014661openalex-snapshot
Current ideas in programming methodology
inferredcites →https://doi.org/10.1007/bfb0014664openalex-snapshot
Is sometimes ever better than always?
inferredcites →https://doi.org/10.1007/bfb0014671openalex-snapshot
Program development by stepwise transformations — The project CIP
inferredcites →https://doi.org/10.1007/bfb0014672openalex-snapshot
Systematics of transformation rules
inferredcites →https://doi.org/10.1007/bfb0014674openalex-snapshot
A study on transformational semantics
inferredcites →https://doi.org/10.1007/bfb0014681openalex-snapshot
Programming methodology and language implications
inferredcites →https://doi.org/10.1007/bfb0014683openalex-snapshot
Semantics of nondeterministic and noncontinuous constructs
inferredcites →https://doi.org/10.1007/bfb0014685openalex-snapshot
Some theoretical aspects of program construction
inferredcites →https://doi.org/10.1007/bfb0021422openalex-snapshot
Models of data objects and data types
inferredcites →https://doi.org/10.1007/bfb0021429openalex-snapshot
Remarks on the impact of program verification on language design
inferredcites →https://doi.org/10.1007/bfb0022460openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1007/bfb0022461openalex-snapshot
Modal logic of concurrent nondeterministic programs
inferredcites →https://doi.org/10.1007/bfb0022470openalex-snapshot
Denotational semantics of parallelism
inferredcites →https://doi.org/10.1007/bfb0022503openalex-snapshot
Consistent semantics for a data flow language
inferredcites →https://doi.org/10.1007/bfb0022512openalex-snapshot
Abstract implementation of abstract data types
inferredcites →https://doi.org/10.1007/bfb0022517openalex-snapshot
A simple class of algorithmic specifications for abstract software modules
inferredcites →https://doi.org/10.1007/bfb0022519openalex-snapshot
Van wijngaarden grammars as a special information processing model
inferredcites →https://doi.org/10.1007/bfb0022525openalex-snapshot
New results on completeness and consistency of abstract data types
inferredcites →https://doi.org/10.1007/bfb0022527openalex-snapshot
Completeness in classical logic of complex algorithms
inferredcites →https://doi.org/10.1007/bfb0022528openalex-snapshot
Initially — Restricting algebraic theories
inferredcites →https://doi.org/10.1007/bfb0022532openalex-snapshot
Axioms of algorithmic logic univocally determine semantics of programs
inferredcites →https://doi.org/10.1007/bfb0022534openalex-snapshot
Verifying concurrent system specifications in COSY
inferredcites →https://doi.org/10.1007/bfb0022542openalex-snapshot
Abstract data types as lattices of finitely generated models
inferredcites →https://doi.org/10.1007/bfb0023017openalex-snapshot
Theory of Program Structures: Schemes, Semantics, Verification
inferredcites →https://doi.org/10.1007/bfb0029529openalex-snapshot
Programming language semantics in a typed lambda-calculus
inferredcites →https://doi.org/10.1007/bfb0029534openalex-snapshot
Sequentially and parallelly computable functionals
inferredcites →https://doi.org/10.1016/0004-3702(77)90025-xopenalex-snapshot
Making computational sense of Montague's intensional logic
inferredcites →https://doi.org/10.1016/0004-3702(80)90050-8openalex-snapshot
Syntax-directed, semantics-supported program synthesis
inferredcites →https://doi.org/10.1016/0020-0190(78)90038-8openalex-snapshot
What is an abstract datatype?
inferredcites →https://doi.org/10.1016/0020-0190(80)90048-4openalex-snapshot
A simple relation between relational and predicate transformer semantics for nondeterministic programs
inferredcites →https://doi.org/10.1016/0020-0190(81)90007-7openalex-snapshot
Presburger arithmetic with array segments
inferredcites →https://doi.org/10.1016/0020-0190(81)90071-5openalex-snapshot
Bunch theory: A simple set theory for computer science
inferredcites →https://doi.org/10.1016/0022-0000(79)90006-0openalex-snapshot
Semantics of nondeterminism, concurrency, and communication
inferredcites →https://doi.org/10.1016/0022-0000(79)90011-4openalex-snapshot
Final algebra semantics and data type extensions
inferredcites →https://doi.org/10.1016/0096-0551(75)90014-4openalex-snapshot
Parallel programming: An axiomatic approach
inferredcites →https://doi.org/10.1016/0096-0551(78)90003-6openalex-snapshot
Formal semantics of a SNOBOL4 subset
inferredcites →https://doi.org/10.1016/0096-0551(79)90018-3openalex-snapshot
Semantic specification using two-level grammars: Blocks, procedures and parameters
inferredcites →https://doi.org/10.1016/0096-0551(81)90045-xopenalex-snapshot
Methods for specifying static semantics
inferredcites →https://doi.org/10.1016/0304-3975(76)90029-3openalex-snapshot
Computability concepts for programming language semantics
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(79)90059-8openalex-snapshot
Data types, abstract data types and their specification problem
inferredcites →https://doi.org/10.1016/0304-3975(80)90005-5openalex-snapshot
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
inferredcites →https://doi.org/10.1016/0304-3975(80)90015-8openalex-snapshot
A mathematical semantics for a nondeterministic typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(80)90056-0openalex-snapshot
Unique fixed points vs. least fixed points
inferredcites →https://doi.org/10.1016/0304-3975(81)90039-6openalex-snapshot
Nondeterministic flowchart programs with recursive procedures: semantics and correctness I
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0306-4379(80)90056-3openalex-snapshot
A survey of input-output semantics and program verification, rep. 344
inferredcites →https://doi.org/10.1016/s0022-0000(77)80006-8openalex-snapshot
A characterization of weakest preconditions
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1016/s0304-3975(81)80001-1openalex-snapshot
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
showing the first 200 of 291 · page through all 291
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_67openalex-snapshot
Proof rules for communication abstractions
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_13openalex-snapshot
An implementation from a direct semantics definition
inferred← citeshttps://doi.org/10.1007/978-1-4612-5373-0_39openalex-snapshot
The Role of Modern Algebra in Computing
inferred← citeshttps://doi.org/10.1007/bf01068190openalex-snapshot
Automatic verification of functional programs
inferred← citeshttps://doi.org/10.1007/bf03037224openalex-snapshot
Some analogues of partial and mixed computations in the logical programming approach
inferred← citeshttps://doi.org/10.1007/bfb0028816openalex-snapshot
Recent results on continuous ordered algebras
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90147-topenalex-snapshot
Classes of finite relations as initial abstract data types I
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90059-9openalex-snapshot
Tree constructions of free continuous algebras
inferred← citeshttps://doi.org/10.1016/0022-4049(83)90080-4openalex-snapshot
P-varieties - a signature independent characterization of varieties of ordered algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90109-8openalex-snapshot
Abstract data types and algebraic semantics of programming languages
inferred← citeshttps://doi.org/10.1016/j.biosystems.2007.06.005openalex-snapshot
Abstract heterarchy: Time/state-scale re-entrant form
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.014openalex-snapshot
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80030-xopenalex-snapshot
Varieties of ordered algebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot
The equational logic of fixed points
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.