On the public citation graph

A logic for Miranda

https://doi.org/10.1007/bf01887213
0 signed · 20 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-15975-4_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-17162-2_126openalex-snapshot
Categories of partial morphisms and the λP-calculus
inferredcites →https://doi.org/10.1007/978-1-4612-6272-5openalex-snapshot
The Design of Well-Structured and Correct Programs
inferredcites →https://doi.org/10.1007/bfb0061839openalex-snapshot
Identity and existence in intuitionistic logic
inferredcites →https://doi.org/10.1016/0141-9331(87)90510-2openalex-snapshot
The implementation of functional programming languages
inferredcites →https://doi.org/10.1017/cbo9780511526602openalex-snapshot
Logic and Computation
inferredcites →https://doi.org/10.1109/32.24710openalex-snapshot
Formal methods applied to a floating-point number system
inferredcites →https://doi.org/10.1145/319838.319839openalex-snapshot
Laws in Miranda
inferredcites →https://doi.org/10.5860/choice.46-2143openalex-snapshot
A course on mathematical logic

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-54834-3_18openalex-snapshot
LPF and MPLω — A logical comparison of VDM SL and COLD-K
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_12openalex-snapshot
Reasoning with higher order partial functions
inferred← citeshttps://doi.org/10.1007/3-540-60675-0_35openalex-snapshot
Elementary strong functional programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-3215-8_23openalex-snapshot
Formulating Haskell
inferred← citeshttps://doi.org/10.1007/bf01211216openalex-snapshot
A logic for Miranda, revisited
inferred← citeshttps://doi.org/10.1016/s0920-5489(97)00005-6openalex-snapshot
From ACT-ONE to Miranda, a translation experiment
inferred← citeshttps://doi.org/10.1109/lics.1993.287597openalex-snapshot
Relational properties of recursively defined domains
inferred← citeshttps://doi.org/10.1145/165180.165199openalex-snapshot
An operational semantics for I/O in a lazy functional language
inferred← citeshttps://doi.org/10.14236/ewic/fp1995.4openalex-snapshot
Supporting Reasoning about Functional Programs: An Operational Approach
inferred← citeshttps://doi.org/10.3233/fi-1997-313404openalex-snapshot
The ζ-Semantics: A Comprehensive Semantics for Functional Programs
inferred← citeshttps://doi.org/10.5525/gla.thesis.4609openalex-snapshot
Supporting formal reasoning about functional programs
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.