On the public citation graph

Functor categories and two-level languages

https://doi.org/10.1007/bfb0053552
0 signed · 36 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-15648-8_17openalex-snapshot
Continuation semantics in typed lambda-calculi
inferredcites →https://doi.org/10.1007/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
inferredcites →https://doi.org/10.1007/3-540-57880-3_19openalex-snapshot
Polymorphic binding-time analysis
inferredcites →https://doi.org/10.1016/0168-0072(91)90067-vopenalex-snapshot
Kripke-style models for typed lambda calculus
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/s1571-0661(05)80155-0openalex-snapshot
A categorical account of two-level languages
inferredcites →https://doi.org/10.1017/cbo9780511525902.013openalex-snapshot
Semantics of local variables
inferredcites →https://doi.org/10.1017/cbo9780511526572openalex-snapshot
Two-Level Functional Languages
inferredcites →https://doi.org/10.1017/cbo9780511526619.006openalex-snapshot
Metalanguages and Applications
inferredcites →https://doi.org/10.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferredcites →https://doi.org/10.1017/s0956796800000782openalex-snapshot
Specifying the correctness of binding-time analysis
inferredcites →https://doi.org/10.1073/pnas.50.5.869openalex-snapshot
FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
inferredcites →https://doi.org/10.1109/lics.1996.561302openalex-snapshot
A fully-abstract model for the π-calculus
inferredcites →https://doi.org/10.1145/128861.128864openalex-snapshot
A self-applicable partial evaluator for the lambda calculus
inferredcites →https://doi.org/10.5860/choice.34-3356openalex-snapshot
Foundations for programming languages
inferredcites →https://doi.org/10.7146/dpb.v12i156.7430openalex-snapshot
Type Algebras, Functor Categories, and Block Structure

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-44806-3_2openalex-snapshot
Accomplishments and Research Challenges in Meta-programming
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_4openalex-snapshot
Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming
inferred← citeshttps://doi.org/10.1007/3-540-45442-x_6openalex-snapshot
Fine Control of Demand in Haskell
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_14openalex-snapshot
The Correctness of Type Specialisation
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_17openalex-snapshot
Aspects of the PGG System: Specialization for Standard Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_2openalex-snapshot
HOBiT: Programming Lenses Without Using Lens Combinators
inferred← citeshttps://doi.org/10.1007/978-3-540-39815-8_4openalex-snapshot
Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection
inferred← citeshttps://doi.org/10.1007/978-3-540-39815-8_6openalex-snapshot
Staged Notational Definitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.013openalex-snapshot
Two-level languages for program optimization
inferred← citeshttps://doi.org/10.1017/s0956796802004598openalex-snapshot
Closed types for a safe imperative MetaML
inferred← citeshttps://doi.org/10.1017/s0956796823000126openalex-snapshot
Sparcl : A language for partially invertible computation
inferred← citeshttps://doi.org/10.1017/s0956796899003469openalex-snapshot
Combinators for program generation
inferred← citeshttps://doi.org/10.1145/3409000openalex-snapshot
Sparcl: a language for partially-invertible computation
inferred← citeshttps://doi.org/10.1145/3607830openalex-snapshot
Embedding by Unembedding
inferred← citeshttps://doi.org/10.1145/507635.507646openalex-snapshot
Macros as multi-stage computations
inferred← citeshttps://doi.org/10.1145/604131.604134openalex-snapshot
Environment classifiers
inferred← citeshttps://doi.org/10.21236/ada375725openalex-snapshot
Application of Metaprogramming to Program Generation
inferred← citeshttps://doi.org/10.5555/954186.954192openalex-snapshot
Staged notational definitions
inferred← citeshttps://doi.org/10.6083/9g54xh95nopenalex-snapshot
A categorical analysis of multi-level languages (extended abstract)
inferred← citeshttps://doi.org/10.7146/brics.v7i46.20213openalex-snapshot
Reasoning About Code-Generation in Two-Level Languages
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.