On the public citation graph
A tactic calculus — abridged version
0 signed · 40 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-15975-4_33openalex-snapshot
How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_26openalex-snapshot
A Programming Notation for Tactical Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-74884-4_5openalex-snapshot
Lectures on Constructive Functional Programming
inferredcites →https://doi.org/10.1007/bf00881900openalex-snapshot
Implementing tactics and tacticals in a higher-order logic programming language
inferredcites →https://doi.org/10.1007/bf01213535openalex-snapshot
A tactic calculus — abridged version
inferredcites →https://doi.org/10.1017/cbo9780511811326openalex-snapshot
ML for the Working Programmer
inferredcites →https://doi.org/10.5287/ora-nodo7ezmeopenalex-snapshot
Machine−Assisted Theorem−Proving for Software Engineering
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_11openalex-snapshot
A Tour Through the Programming Choices: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_32openalex-snapshot
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_13openalex-snapshot
Improving the Usability of HOL Through Controlled Automation Tactics
inferred← citeshttps://doi.org/10.1007/978-3-642-19829-8_18openalex-snapshot
Automating Refinement of Circus Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-33826-7_24openalex-snapshot
Implementing Tactics of Refinement in CRefine
inferred← citeshttps://doi.org/10.1007/bfb0000492openalex-snapshot
Algebraic composition and refinement of proofs
inferred← citeshttps://doi.org/10.1007/s00165-003-0003-8openalex-snapshot
ArcAngel: a Tactic Language for Refinement
inferred← citeshttps://doi.org/10.1007/s00165-006-0001-8openalex-snapshot
Angelic nondeterminism in the unifying theories of programming
inferred← citeshttps://doi.org/10.1007/s00165-011-0218-zopenalex-snapshot
Mechanised support for sound refinement tactics
inferred← citeshttps://doi.org/10.1007/s11334-011-0171-2openalex-snapshot
Software engineering as the design theoretic transformation of software problems
inferred← citeshttps://doi.org/10.1007/s11786-010-0025-6openalex-snapshot
Tactics for Hierarchical Proof
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.024openalex-snapshot
Angelic Nondeterminism and Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.010openalex-snapshot
ArcAngelC: a Refinement Tactic Language for
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.027openalex-snapshot
Supporting ArcAngel in ProofPower
inferred← citeshttps://doi.org/10.1016/j.infsof.2017.01.010openalex-snapshot
A design theory for software engineering
inferred← citeshttps://doi.org/10.1016/j.scico.2010.11.012openalex-snapshot
A tactic language for refinement of state-rich concurrent specifications
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.008openalex-snapshot
Angelic processes for CSP via the UTP
inferred← citeshttps://doi.org/10.1023/a:1021975117537openalex-snapshot
External Rewriting for Skeptical Proof Assistants
inferred← citeshttps://doi.org/10.1109/apsec.2001.991456openalex-snapshot
Program specialisation in the refinement calculus
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347535openalex-snapshot
Refine and gabriel: support for refinement and tactics
inferred← citeshttps://doi.org/10.1109/sefm.2004.37openalex-snapshot
Refine and gabriel: support for refinement and tactics
inferred← citeshttps://doi.org/10.1109/tse.2007.70769openalex-snapshot
Problem Oriented Software Engineering: Solving the Package Router Control Problem
inferred← citeshttps://doi.org/10.1112/s1461157000000759openalex-snapshot
Ergo 6: A Generic Proof Engine that Uses Prolog Proof Technology
inferred← citeshttps://doi.org/10.1145/1599410.1599423openalex-snapshot
An Isabelle/HOL-based model of stratego-like traversal strategies
inferred← citeshttps://doi.org/10.1145/2505879.2505890openalex-snapshot
An operational foundation for the tactic language of Coq
inferred← citeshttps://doi.org/10.1145/888251.888264openalex-snapshot
Simplification and termination of strategies in rule-based languages
showing the first 31 of 32 · page through all 32
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.