On the public citation graph

Combining first and higher order rewrite systems with type assignment systems

0 signed · 43 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-09724-4openalex-snapshot

Edinburgh LCF

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-53904-2_84openalex-snapshot

Adding algebraic rewriting to the untyped lambda calculus (extended abstract)

inferredcites →https://doi.org/10.1007/3-540-54317-1_96openalex-snapshot

Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved

inferredcites →https://doi.org/10.1007/3-540-55251-0_17openalex-snapshot

Partial type assignment in left linear applicative term rewriting systems

inferredcites →https://doi.org/10.1007/bf01211394openalex-snapshot

Types with intersection: An introduction

inferredcites →https://doi.org/10.1007/bfb0035757openalex-snapshot

Polymorphic rewriting conserves algebraic strong normalization and confluence

inferredcites →https://doi.org/10.1016/0020-0190(87)90122-0openalex-snapshot

Counterexamples to termination for the direct sum of term rewriting systems

inferredcites →https://doi.org/10.1016/0304-3975(86)90109-xopenalex-snapshot

Typing and computational properties of lambda expressions

inferredcites →https://doi.org/10.1016/0304-3975(91)90037-3openalex-snapshot

Polymorphic rewriting conserves algebraic strong normalization

inferredcites →https://doi.org/10.1016/0890-5401(92)90064-mopenalex-snapshot

Adding algebraic rewriting to the untyped lambda calculus

inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot

Rewrite Systems

inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot

The Lambda Calculus - Its Syntax and Semantics

inferredcites →https://doi.org/10.1109/lics.1988.5103openalex-snapshot

Combining algebra and higher-order types

inferredcites →https://doi.org/10.1109/lics.1991.151658openalex-snapshot

Higher-order critical pairs

inferredcites →https://doi.org/10.1109/lics.1991.151659openalex-snapshot

A computation model for executable higher-order algebraic specification languages

inferredcites →https://doi.org/10.1142/s0129054190000138openalex-snapshot

COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS

inferredcites →https://doi.org/10.1145/74540.74582openalex-snapshot

Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system

inferredcites →https://doi.org/10.2307/1968867openalex-snapshot

On Theories with a Combinatorial Definition of "Equivalence"

inferredcites →https://doi.org/10.2307/2273659openalex-snapshot

A filter lambda model and the completeness of type assignment

inferredcites →https://doi.org/10.2307/2274588openalex-snapshot

J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1996.2617openalex-snapshot

Normalization Results for Typeable Rewrite Systems

inferred← citeshttps://doi.org/10.1007/3-540-56868-9_39openalex-snapshot