On the public citation graph

The VLISP verified PreScheme compiler

0 signed · 48 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.1006/inco.1994.1072openalex-snapshot
Conditional Lambda-Theories and the Verification of Static Properties of Programs
inferredcites →https://doi.org/10.1007/3-540-55511-0_15openalex-snapshot
Correctness of procedure representations in higher-order assembly language
inferredcites →https://doi.org/10.1007/3-540-55602-8_181openalex-snapshot
Automated correctness proofs of machine code programs for a commercial microprocessor
inferredcites →https://doi.org/10.1007/3540543961_29openalex-snapshot
Making abstract machines less abstract
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bf01018614openalex-snapshot
A tractable Scheme implementation
inferredcites →https://doi.org/10.1007/bf01128406openalex-snapshot
VLISP: A verified implementation of Scheme
inferredcites →https://doi.org/10.1007/bf01128407openalex-snapshot
The VLISP verified Scheme system
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0019-9958(83)80041-2openalex-snapshot
Loops in combinator-based compilers
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/cbo9780511811326openalex-snapshot
ML for the Working Programmer
inferredcites →https://doi.org/10.1093/notesj/32.3.377-aopenalex-snapshot
CHAPMAN AND HALL
inferredcites →https://doi.org/10.1109/ieeestd.1991.101032openalex-snapshot
IEEE Standard for the Scheme Programming Language
inferredcites →https://doi.org/10.1145/13310.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/141471.141528openalex-snapshot
Proving the correctness of storage representations
inferredcites →https://doi.org/10.1145/357172.357179openalex-snapshot
Deriving Target Code as a Representation of Continuation Semantics
inferredcites →https://doi.org/10.1145/582153.582179openalex-snapshot
Semantics-directed machine architecture
inferredcites →https://doi.org/10.1145/75277.75302openalex-snapshot
Realistic compilation by program transformation (detailed summary)
inferredcites →https://doi.org/10.1145/800055.802052openalex-snapshot
The scheme 311 compiler an exercise in denotational semantics
inferredcites →https://doi.org/10.1145/989393.989414openalex-snapshot
Orbit
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML

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-45788-7_8openalex-snapshot
Lambda-Lifting in Quadratic Time
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_11openalex-snapshot
Translation Validation: From SIGNAL to C
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_87openalex-snapshot
Three applications of formal methods at MITRE
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_49openalex-snapshot
Compiler correctness for concurrent languages
inferred← citeshttps://doi.org/10.1007/978-1-4615-2339-0_1openalex-snapshot
VLISP: A Verified Implementation of Scheme
inferred← citeshttps://doi.org/10.1007/978-1-4615-2339-0_2openalex-snapshot
The VLISP Verified Scheme System
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_13openalex-snapshot
Executing Verified Compiler Specification
inferred← citeshttps://doi.org/10.1007/978-3-540-85373-2_3openalex-snapshot
Optimal Lambda Lifting in Quadratic Time
inferred← citeshttps://doi.org/10.1007/bf01128406openalex-snapshot
VLISP: A verified implementation of Scheme
inferred← citeshttps://doi.org/10.1007/bf01128407openalex-snapshot
The VLISP verified Scheme system
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.022openalex-snapshot
Cobalt: A Language for Writing Provably-Sound Compiler Optimizations
inferred← citeshttps://doi.org/10.1017/s0956796807006478openalex-snapshot
An operational semantics for Scheme
inferred← citeshttps://doi.org/10.1145/1069774.1069792openalex-snapshot
Formal validation of pattern matching code
inferred← citeshttps://doi.org/10.1145/224164.224193openalex-snapshot
Compiler correctness for parallel languages
inferred← citeshttps://doi.org/10.1145/263699.263755openalex-snapshot
Denotational semantics using an operationally-based term model
inferred← citeshttps://doi.org/10.1145/277650.277752openalex-snapshot
The design and implementation of a certifying compiler
inferred← citeshttps://doi.org/10.1145/277652.277752openalex-snapshot
The design and implementation of a certifying compiler
inferred← citeshttps://doi.org/10.1145/507635.507646openalex-snapshot
Macros as multi-stage computations
inferred← citeshttps://doi.org/10.1145/507669.507646openalex-snapshot
Macros as multi-stage computations
inferred← citeshttps://doi.org/10.1145/780822.781156openalex-snapshot
Automatically proving the correctness of compiler optimizations
inferred← citeshttps://doi.org/10.1145/781131.781156openalex-snapshot
Automatically proving the correctness of compiler optimizations
inferred← citeshttps://doi.org/10.1145/989393.989454openalex-snapshot
The design and implementation of a certifying compiler
inferred← citeshttps://doi.org/10.22028/d291-25991openalex-snapshot
Compiler verification in the context of pervasive system verification
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.