On the public citation graph
Natural semantics
0 signed · 210 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/spe.4380100203openalex-snapshot
Logic programming and compiler writing
inferredcites →https://doi.org/10.1007/3-540-13346-1_11openalex-snapshot
Executable specification of static semantics
inferredcites →https://doi.org/10.1007/3-540-15198-2_7openalex-snapshot
Three approaches to type structure
inferredcites →https://doi.org/10.1007/3-540-15975-4_29openalex-snapshot
The categorical abstract machine
inferredcites →https://doi.org/10.1007/bfb0014973openalex-snapshot
The natural dynamic semantics of mini-Standard ML
inferredcites →https://doi.org/10.1016/j.jlap.2004.05.001openalex-snapshot
A structural approach to operational semantics
inferredcites →https://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
inferredcites →https://doi.org/10.1145/319838.319847openalex-snapshot
A simple applicative language: mini-ML
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1997.1526openalex-snapshot
The Complexity of the Evaluation of Complex Algebra Expressions
inferred← citeshttps://doi.org/10.1007/11506676_16openalex-snapshot
From Natural Semantics to Abstract Machines
inferred← citeshttps://doi.org/10.1007/11784180_5openalex-snapshot
Data Movement Optimisation in Point-Free Form
inferred← citeshttps://doi.org/10.1007/11940197_1openalex-snapshot
Multi-paradigmatic Model-Based Testing
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_19openalex-snapshot
Demonstrating Lambda Calculus Reduction
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_49openalex-snapshot
The Varieties of Programming Language Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_21openalex-snapshot
Design and Correctness of Program Transformations Based on Control-Flow Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_18openalex-snapshot
The Varieties of Programming Language Semantics And Their Uses
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_9openalex-snapshot
Using, Understanding, and Unraveling the OCaml Language From Practice to Theory and Vice Versa
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_2openalex-snapshot
Constructor Subtyping in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_4openalex-snapshot
Enhanced Control Flow Graphs in Montages
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_4openalex-snapshot
Logical Specification of Operational Semantics
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_20openalex-snapshot
A Curry-Howard Isomorphism for Compilation and Program Execution
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_16openalex-snapshot
Dead Code Elimination through Dependent Types
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_7openalex-snapshot
Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_20openalex-snapshot
Two approaches towards the formalisation of VDM
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_55openalex-snapshot
Implementation of an interpreter for a parallel language in centaur
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_12openalex-snapshot
Functional evaluation of strongly non circular typol specifications
inferred← citeshttps://doi.org/10.1007/3-540-53452-0_51openalex-snapshot
CENTAUR: Towards a “software tool box” for programming environments
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_57openalex-snapshot
A non-standard inductive semantics
inferred← citeshttps://doi.org/10.1007/3-540-53912-3_20openalex-snapshot
A meta-environment for generating programming environments
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_19openalex-snapshot
Tactical tools for distributing VDM specifications
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_156openalex-snapshot
Reduction and unification in Lambda calculi with subtypes
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_190openalex-snapshot
Implementing the meta-theory of deductive systems
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_42openalex-snapshot
On the action semantics of concurrent programming languages
inferred← citeshttps://doi.org/10.1007/3-540-57301-1_27openalex-snapshot
Queries on structures in hypertext
inferred← citeshttps://doi.org/10.1007/3-540-57499-9_22openalex-snapshot
Program development in an algebraic setting
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_80openalex-snapshot
The expressive power of Structural Operational Semantics with explicit assumptions
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_5openalex-snapshot
Origin tracking for higher-order term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_10openalex-snapshot
RML — A new language and implementation for Natural Semantics
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_29openalex-snapshot
Dynamic dependence in term rewriting systems and its application to program slicing
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_217openalex-snapshot
Generic techniques for source-level debugging and dynamic program slicing
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_227openalex-snapshot
Formal specification and prototyping of a program specializer
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_28openalex-snapshot
Natural-semantics-based abstract interpretation (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-61053-7_61openalex-snapshot
A compiler for natural semantics
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_23openalex-snapshot
BTA Algorithms to ensure termination of off-line partial evaluation
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_52openalex-snapshot
A type-free resource-aware λ-calculus
inferred← citeshttps://doi.org/10.1007/3540547428_43openalex-snapshot
Rational design of distributed applications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3166-3_5openalex-snapshot
Complexity Analysis for a Lazy Higher-Order Language
inferred← citeshttps://doi.org/10.1007/978-1-4471-4156-3_4openalex-snapshot
A First-Order Functional Language
inferred← citeshttps://doi.org/10.1007/978-1-84882-736-3_8openalex-snapshot
Programming Language Description Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_6openalex-snapshot
Challenges for Formal Semantic Description: Responses from the Main Approaches
inferred← citeshttps://doi.org/10.1007/978-3-030-03418-4_11openalex-snapshot
Programming Language Specification and Implementation
inferred← citeshttps://doi.org/10.1007/978-3-030-03418-4_23openalex-snapshot
Design for ‘X’ Through Model Transformation
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_44openalex-snapshot
A Calculus for Language Transformations
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_7openalex-snapshot
Soundness Conditions for Big-Step Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_2openalex-snapshot
Cost Analysis of Smart Contracts Via Parametric Resource Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-76020-5_12openalex-snapshot
What is the Natural Abstraction Level of an Algorithm?
inferred← citeshttps://doi.org/10.1007/978-3-030-83978-9_2openalex-snapshot
A Generic Back-End for Exploratory Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-85082-1_17openalex-snapshot
Natural Semantics for Domain-Specific Language
inferred← citeshttps://doi.org/10.1007/978-3-030-87348-6_1openalex-snapshot
The $$\mathbb {K}$$ Vision for the Future of Programming Language Design and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-91265-9_4openalex-snapshot
Reasoning About Iteration and Recursion Uniformly Based on Big-Step Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_20openalex-snapshot
Automatic Alignment in Higher-Order Probabilistic Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_18openalex-snapshot
Reverse Template Processing Using Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-031-45784-5_3openalex-snapshot
Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation
inferred← citeshttps://doi.org/10.1007/978-3-032-13711-1_6openalex-snapshot
On the Design of Program Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-11629-7_3openalex-snapshot
Incorporating First-Order Unification into Functional Language via First-Class Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-14806-9_4openalex-snapshot
Constructing the Views Framework
inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_8openalex-snapshot
Calculating Certified Compilers for Non-deterministic Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_28openalex-snapshot
From Rewriting Logic, to Programming Language Semantics, to Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_17openalex-snapshot
Concolic Execution in Functional Programming by Program Instrumentation
inferred← citeshttps://doi.org/10.1007/978-3-319-46613-2_9openalex-snapshot
Object-Oriented Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-60789-4_4openalex-snapshot
A First-Order Functional Language
inferred← citeshttps://doi.org/10.1007/978-3-319-68288-4_13openalex-snapshot
LDScript: A Linked Data Script Language
inferred← citeshttps://doi.org/10.1007/978-3-540-30101-1_11openalex-snapshot
Semantic Essence of AsmL: Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_4openalex-snapshot
Imperative Object-Based Calculi in Co-inductive Type Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-69937-8_1openalex-snapshot
Inter-deriving Semantic Artifacts for Object-Oriented Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_22openalex-snapshot
Specifying Monogenetic Specializers by Means of a Relation Between Source and Residual Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_7openalex-snapshot
Automata-Based Confidentiality Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-642-00593-0_8openalex-snapshot
A Formal Way from Text to Code Templates
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_15openalex-snapshot
Converting between Combinatory Reduction Systems and Big Step Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_2openalex-snapshot
Action Semantics in Retrospect
inferred← citeshttps://doi.org/10.1007/978-3-642-04652-0_3openalex-snapshot
From Reduction-Based to Reduction-Free Normalization
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_8openalex-snapshot
K-Maude: A Rewriting Based Tool for Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_1openalex-snapshot
The Rewriting Logic Semantics Project: A Progress Report
inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_2openalex-snapshot
The Laws of Programming Unify Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-32096-5_3openalex-snapshot
Reasoning about I/O in Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-33182-4_4openalex-snapshot
Left Recursion in Parsing Expression Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-34005-5_3openalex-snapshot
$\mathbb{K}$ Framework Distilled
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_4openalex-snapshot
Algebra Unifies Operational Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_3openalex-snapshot
Pretty-Big-Step Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_24openalex-snapshot
From Small-Step Semantics to Big-Step Semantics, Automatically
inferred← citeshttps://doi.org/10.1007/978-3-642-40561-7_20openalex-snapshot
Program Transformation Based on Symbolic Execution and Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-41660-6_9openalex-snapshot
Toward a Theory of Self-explaining Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_15openalex-snapshot
Deriving Pretty-Big-Step Semantics from Small-Step Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-46734-3_4openalex-snapshot
Reusable Components of Semantic Specifications
inferred← citeshttps://doi.org/10.1007/978-4-431-54436-4_3openalex-snapshot
An Object Calculus with Remote Method Invocation
inferred← citeshttps://doi.org/10.1007/978-981-19-3951-8_63openalex-snapshot
CultTags—Tags with Contextual Relevance
inferred← citeshttps://doi.org/10.1007/bf00885767openalex-snapshot
Reduction and unification in lambda calculi with a general notion of subtype
inferred← citeshttps://doi.org/10.1007/bf01212526openalex-snapshot
A strict functional language with cyclic recursive data
inferred← citeshttps://doi.org/10.1007/bf01995105openalex-snapshot
Theo: An interactive proof development system
inferred← citeshttps://doi.org/10.1007/bf03037137openalex-snapshot
Partial evaluation with inference rules
inferred← citeshttps://doi.org/10.1007/bfb0013609openalex-snapshot
Implementing λ-calculus reduction strategies in extended logic programming languages
inferred← citeshttps://doi.org/10.1007/bfb0013612openalex-snapshot
Natural semantics and some of its meta-theory in Elf
inferred← citeshttps://doi.org/10.1007/bfb0014973openalex-snapshot
The natural dynamic semantics of mini-Standard ML
inferred← citeshttps://doi.org/10.1007/bfb0019412openalex-snapshot
Animators for generated programming environments
inferred← citeshttps://doi.org/10.1007/bfb0024174openalex-snapshot
Inference-based overloading resolution for ADA
inferred← citeshttps://doi.org/10.1007/bfb0026582openalex-snapshot
A calculus for exploiting data parallelism on recursively defined data
inferred← citeshttps://doi.org/10.1007/s00354-016-0303-1openalex-snapshot
A Foreign Language Interface from ML to Shell
inferred← citeshttps://doi.org/10.1007/s10817-011-9218-1openalex-snapshot
A Two-Level Logic Approach to Reasoning About Computations
inferred← citeshttps://doi.org/10.1007/s10817-016-9380-6openalex-snapshot
A Semantic Framework for Proof Evidence
inferred← citeshttps://doi.org/10.1007/s10990-011-9079-7openalex-snapshot
Making “stricterness” more relevant
inferred← citeshttps://doi.org/10.1007/s11227-016-1679-xopenalex-snapshot
Automatic parallelization of XQuery programs on multi-core systems
inferred← citeshttps://doi.org/10.1016/j.artint.2009.06.002openalex-snapshot
Vivid: A framework for heterogeneous problem solving
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.069openalex-snapshot
Aspect-Oriented Action Semantics Descriptions
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.03.035openalex-snapshot
New Developments in Environment Machines
inferred← citeshttps://doi.org/10.1016/j.ic.2005.11.002openalex-snapshot
A stable programming language
inferred← citeshttps://doi.org/10.1016/j.ic.2007.12.004openalex-snapshot
Coinductive big-step operational semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.026openalex-snapshot
A rewriting logic approach to operational semantics
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.008openalex-snapshot
Modular structural operational semantics
inferred← citeshttps://doi.org/10.1016/j.scico.2012.11.006openalex-snapshot
From regexes to parsing expression grammars
inferred← citeshttps://doi.org/10.1016/j.scico.2014.01.013openalex-snapshot
Left recursion in Parsing Expression Grammars
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00040-8openalex-snapshot
Stackability in the simply-typed call-by-value lambda calculus
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00047-7openalex-snapshot
A generative methodology for the design of abstract machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00168-2openalex-snapshot
Encoding transition systems in sequent calculus
inferred← citeshttps://doi.org/10.1016/s0950-5849(98)00087-1openalex-snapshot
Dynamic dependence in term rewriting systems and its application to program slicing
inferred← citeshttps://doi.org/10.1016/s1389-1286(01)00162-1openalex-snapshot
An integrated development environment for Java Card
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00279-8openalex-snapshot
Encoding Generic Judgments
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80973-3openalex-snapshot
Demonstrating Lambda Calculus Reduction
inferred← citeshttps://doi.org/10.1017/s0956796819000017openalex-snapshot
The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus
inferred← citeshttps://doi.org/10.1017/s0956796825100038openalex-snapshot
Call-by-value and call-by-name: A simple proof of a classic theorem
inferred← citeshttps://doi.org/10.1017/s0960129500000293openalex-snapshot
Fully abstract translations between functional languages
inferred← citeshttps://doi.org/10.1017/s0960129508006658openalex-snapshot
Types for ambient and process mobility
inferred← citeshttps://doi.org/10.1017/s0960129508006750openalex-snapshot
iRho: an imperative rewriting calculus
inferred← citeshttps://doi.org/10.1017/s096012951100020xopenalex-snapshot
Modelling declassification policies using abstract domain completeness
inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot
Analysis and Transformation of Constrained Horn Clauses for Program Verification
inferred← citeshttps://doi.org/10.1109/32.129219openalex-snapshot
SPARE: a development environment for program analysis algorithms
inferred← citeshttps://doi.org/10.1109/aspec.2007.60openalex-snapshot
Definition of an Executable SPEM 2.0
inferred← citeshttps://doi.org/10.1109/csf.2015.33openalex-snapshot
An Analysis of Universal Information Flow Based on Self-Composition
inferred← citeshttps://doi.org/10.1109/hicss.1995.375452openalex-snapshot
From a formal dynamic semantics of Sisal to a Sisal environment
inferred← citeshttps://doi.org/10.1109/informatics47936.2019.9119290openalex-snapshot
Software visualization of natural semantics of imperative languages - a teaching tool
inferred← citeshttps://doi.org/10.1109/lics.1991.151641openalex-snapshot
On computational open-endedness in Martin-Lof's type theory
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175706openalex-snapshot
Weak Similarity in Higher-Order Mathematical Operational Semantics
inferred← citeshttps://doi.org/10.1109/synasc.2005.74openalex-snapshot
Theory and practice of programming applied to membrane systems
inferred← citeshttps://doi.org/10.1109/wcre.2001.957831openalex-snapshot
GUSTT: an amorphous slicing system which combines slicing and transformation
inferred← citeshttps://doi.org/10.1109/wi-iat.2010.144openalex-snapshot
The KGRAM Abstract Machine for Knowledge Graph Querying
inferred← citeshttps://doi.org/10.1109/wpc.1994.341266openalex-snapshot
SFAC, a tool for program comprehension by specialization
inferred← citeshttps://doi.org/10.1109/wpc.1996.501128openalex-snapshot
Interprocedural analysis for program comprehension by specialization
inferred← citeshttps://doi.org/10.1145/1814217.1814222openalex-snapshot
Restricted delegation and revocation in language-based security
inferred← citeshttps://doi.org/10.1145/2426890.2426911openalex-snapshot
A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers
inferred← citeshttps://doi.org/10.1145/2678015.2682545openalex-snapshot
Imperative Polymorphism by Store-Based Types as Abstract Interpretations
inferred← citeshttps://doi.org/10.1145/3133841.3133847openalex-snapshot
The semantics of name resolution in grace
inferred← citeshttps://doi.org/10.1145/3136014.3136015openalex-snapshot
Metacasanova: an optimized meta-compiler for domain-specific languages
inferred← citeshttps://doi.org/10.1145/3170472.3133847openalex-snapshot
The semantics of name resolution in grace
inferred← citeshttps://doi.org/10.1145/3237009.3237018openalex-snapshot
Specializing a meta-interpreter
inferred← citeshttps://doi.org/10.1145/3409001openalex-snapshot
Stable relations and abstract interpretation of higher-order programs
inferred← citeshttps://doi.org/10.1145/3434322openalex-snapshot
Petr4: formal foundations for p4 data planes
inferred← citeshttps://doi.org/10.1145/3551357.3551384openalex-snapshot
Certified Derivation of Small-Step From Big-Step Skeletal Semantics
inferred← citeshttps://doi.org/10.1145/3567512.3567527openalex-snapshot
A Language-Parametric Approach to Exploratory Programming Environments
inferred← citeshttps://doi.org/10.1145/3607848openalex-snapshot
A General Fine-Grained Reduction Theory for Effect Handlers
inferred← citeshttps://doi.org/10.1145/3689484.3690734openalex-snapshot
On the Soundness of Auto-completion Services for Dynamically Typed Languages
inferred← citeshttps://doi.org/10.1145/3729334openalex-snapshot
Roulette: A Language for Expressive, Exact, and Efficient Discrete Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3756907.3756926openalex-snapshot
Abstract machines and small-step semantics: a winning ticket for proof automation?
inferred← citeshttps://doi.org/10.1145/3759427.3760377openalex-snapshot
Generic Reduction-Based Interpreters
inferred← citeshttps://doi.org/10.1145/3763067openalex-snapshot
React-tRace: A Semantics for Understanding React Hooks: An Operational Semantics and a Visualizer for Clarifying React Hooks
inferred← citeshttps://doi.org/10.1145/3776718openalex-snapshot
Big-Stop Semantics: Small-Step Semantics in a Big-Step Judgment
inferred← citeshttps://doi.org/10.1145/3779209.3779534openalex-snapshot
Computation-Tree Semantics: An Algorithmic Approach to Structurally Defined Relations
inferred← citeshttps://doi.org/10.1145/71605.71607openalex-snapshot
The syntax definition formalism SDF—reference manual—
inferred← citeshttps://doi.org/10.1201/9780429171529-69openalex-snapshot
Programming Language Semantics
inferred← citeshttps://doi.org/10.1201/9781420040579.ch22openalex-snapshot
An Introduction to Operational Semantics
inferred← citeshttps://doi.org/10.17771/pucrio.acad.26999openalex-snapshot
TYPING DYNAMIC LANGUAGES: A REVIEW
inferred← citeshttps://doi.org/10.2139/ssrn.5970575openalex-snapshot
Stateful Noncommutative Object Algebra (SNOA): A Unified Framework for Stateful, Noncommutative Systems with C# .NET 10 Implementation and Validation
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d4fopenalex-snapshot
Soundness conditions for big-step semantics
inferred← citeshttps://doi.org/10.31577/cai_2019_5_1181openalex-snapshot
Coalgebraic Operational Semantics for an Imperative Language
inferred← citeshttps://doi.org/10.3233/jcs-16832openalex-snapshot
An interpolation-based method for the verification of security protocols
inferred← citeshttps://doi.org/10.32388/s1074vopenalex-snapshot
Reification, Curry-Howard Correspondence, and Didactical Consequences
inferred← citeshttps://doi.org/10.32657/10356/147268openalex-snapshot
Automatic program analysis and verification and their applications in smart contracts
inferred← citeshttps://doi.org/10.3390/math10203800openalex-snapshot
On Coevaluation Behavior and Equivalence
inferred← citeshttps://doi.org/10.4204/eptcs.266.11openalex-snapshot
A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)
inferred← citeshttps://doi.org/10.4204/eptcs.320.4openalex-snapshot
From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation
inferred← citeshttps://doi.org/10.4204/eptcs.369.4openalex-snapshot
A Tool for Describing and Checking Natural Semantics Definitions of Programming Languages
inferred← citeshttps://doi.org/10.4204/eptcs.58.1openalex-snapshot
Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:24)2024openalex-snapshot
Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
inferred← citeshttps://doi.org/10.70675/0d242e5czfe16z49f6za04ezf51f4dabb08eopenalex-snapshot
Mechanized semantics and verified compilation for a dataflow synchronous language with reset
inferred← citeshttps://doi.org/10.70675/0fbba6fbz729az49fdzbf9azfc9f951aa0b0openalex-snapshot
Extraction de code fonctionnel certifié à partir de spécifications inductives
inferred← citeshttps://doi.org/10.70675/a51a26bcz8956z4732za36cz7b444962f77dopenalex-snapshot
Programmation événementielle et programmation à base de règles pour le développement d'applications réactives sensibles au contexte
inferred← citeshttps://doi.org/10.70675/b8a9d0a9zdc25z41ceza2cazff3641f6087eopenalex-snapshot
A type system for embedded rewriting programming
inferred← citeshttps://doi.org/10.70675/ca10a8b8z25e5z4d66z88b1z880ce351c8e9openalex-snapshot
Analyse de codes auto-modifiants pour la sécurité logicielle
inferred← citeshttps://doi.org/10.70675/ca88e9fczaf68z4576z9d6dz280c181eb224openalex-snapshot
Optimization of source code for safety-critical systems
inferred← citeshttps://doi.org/10.70675/dee6cb64z2135z4b1az944bz9d304ab4a6e1openalex-snapshot
Models, Analysis and Execution of Audio Graphs in Interactive Multimedia Systems
inferred← citeshttps://doi.org/10.70675/f63a58cfz1780z43dfz859dz87534ff3f785openalex-snapshot
Institution-based Semantics and Tool Support for the UML
inferred← citeshttps://doi.org/10.70675/ff8907ebzb70cz4fbdzad39z2513988c524copenalex-snapshot
Self-adaptable operational semantics
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.