On the public citation graph

Formal verification of algorithm W: The monomorphic case

https://doi.org/10.1007/bfb0105414
0 signed · 32 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-19129-1_4openalex-snapshot
Unification Revisited
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0014065openalex-snapshot
A verified typechecker
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1007/bfb0037113openalex-snapshot
Pure type systems formalized
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/0167-6423(87)90019-0openalex-snapshot
Basic polymorphic typechecking
inferredcites →https://doi.org/10.1016/0890-5401(90)90018-dopenalex-snapshot
Type inference for polymorphic references
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1017/s0956796800001325openalex-snapshot
Type Reconstruction for Type Classes
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0253905-6openalex-snapshot
The principle type-scheme of an object in combinatory logic
inferredcites →https://doi.org/10.1145/130697.130699openalex-snapshot
Report on the programming language Haskell
inferredcites →https://doi.org/10.1145/143165.143169openalex-snapshot
The essence of functional programming
inferredcites →https://doi.org/10.1145/319838.319847openalex-snapshot
A simple applicative language: mini-ML
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/91556.91592openalex-snapshot
Comprehending monads
inferredcites →https://doi.org/10.2307/1995158openalex-snapshot
The Principal Type-Scheme of an Object in Combinatory Logic
inferredcites →https://doi.org/10.3233/fi-1987-10202openalex-snapshot
A Simple Algorithm and Proof for Type Inference1
inferredcites →https://doi.org/10.48550/arxiv.cs/9711106openalex-snapshot
Generic Automatic Proof Tools
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-36532-x_14openalex-snapshot
Formalization and Verification of a Mail Server in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-40355-2_5openalex-snapshot
Verifying Functional Formalizations – A Type-Theoretical Case Study in PVS
inferred← citeshttps://doi.org/10.1007/bfb0097799openalex-snapshot
Type inference verified: Algorithm W in Isabelle/HOL
inferred← citeshttps://doi.org/10.1023/a:1006277616879openalex-snapshot
Type Inference Verified: Algorithm W in Isabelle/HOL
inferred← citeshttps://doi.org/10.1023/a:1006285817788openalex-snapshot
Certification of a Type Inference Tool for ML: Damas–Milner within Coq
inferred← citeshttps://doi.org/10.1112/s1461157000000188openalex-snapshot
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
inferred← citeshttps://doi.org/10.1145/3689786openalex-snapshot
Type Inference Logics
inferred← citeshttps://doi.org/10.14236/ewic/fm1997.4openalex-snapshot
A Simple Algorithm Specification Language and its Application
inferred← citeshttps://doi.org/10.22456/2175-2745.100968openalex-snapshot
A Mechanized Proof of a Textbook Type Unification Algorithm
inferred← citeshttps://doi.org/10.48456/tr-286openalex-snapshot
Isabelle’s object-logics
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.