On the public citation graph
Another algorithm for bracket abstraction
0 signed · 109 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01448013openalex-snapshot
Über die Bausteine der mathematischen Logik
inferredcites →https://doi.org/10.1017/s0022481200051914openalex-snapshot
An abstraction algorithm for combinatory logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380090105openalex-snapshot
A new implementation technique for applicative languages
inferred← citeshttps://doi.org/10.1002/spe.4380170807openalex-snapshot
On the efficiency of categorical combinators as a rewriting system
inferred← citeshttps://doi.org/10.1002/spe.4380180305openalex-snapshot
Statistics on graph reduction of SASL programs
inferred← citeshttps://doi.org/10.1002/spe.4380240202openalex-snapshot
Compilation of functional languages using flow graph analysis
inferred← citeshttps://doi.org/10.1007/11541868_26openalex-snapshot
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_40openalex-snapshot
Optimized combinatoric code for applicative language implementation
inferred← citeshttps://doi.org/10.1007/3-540-15975-4_32openalex-snapshot
Cobweb — A combinator reduction architecture
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_7openalex-snapshot
A safe approach to parallel combinator reduction (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-16470-7_14openalex-snapshot
The BC-chain method for representing combinators in linear space
inferred← citeshttps://doi.org/10.1007/3-540-17943-7_141openalex-snapshot
Overview of a parallel reduction machine project
inferred← citeshttps://doi.org/10.1007/3-540-18203-9_15openalex-snapshot
Computer architectures for artificial intelligence
inferred← citeshttps://doi.org/10.1007/3-540-18420-1_47openalex-snapshot
On the correspondence of lambda style reduction and combinator style reduction
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_3openalex-snapshot
Rule-based semantics for an extended lambda-calculus
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_63openalex-snapshot
Variable substitution with iconic combinators
inferred← citeshttps://doi.org/10.1007/3-540-60428-6_30openalex-snapshot
A new translation algorithm from lambda calculus into combinatory logic
inferred← citeshttps://doi.org/10.1007/3540543961_14openalex-snapshot
What is an efficient implementation of the λ-calculus?
inferred← citeshttps://doi.org/10.1007/978-1-4471-3182-3_13openalex-snapshot
Simple Type Theory in EVES
inferred← citeshttps://doi.org/10.1007/978-1-4613-0633-7_10openalex-snapshot
Paradigms for Optical Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_24openalex-snapshot
Making Higher-Order Superposition Work
inferred← citeshttps://doi.org/10.1007/978-3-032-12086-1_12openalex-snapshot
The Turner 2-Strings Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-90686-7_3openalex-snapshot
$$\lambda $$ λ to SKI, Semantically
inferred← citeshttps://doi.org/10.1007/978-3-642-40447-4_1openalex-snapshot
Some History of Functional Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-7091-7553-8_4openalex-snapshot
An Architecture for Full Text Retrieval Systems
inferred← citeshttps://doi.org/10.1007/978-94-015-6878-4_15openalex-snapshot
Combinators and Grammars
inferred← citeshttps://doi.org/10.1007/bf00134555openalex-snapshot
Combinatory grammars and parasitic gaps
inferred← citeshttps://doi.org/10.1007/bf00630734openalex-snapshot
Gapping as constituent coordination
inferred← citeshttps://doi.org/10.1007/bf03037465openalex-snapshot
A fast algorithm for translating combinator expressions with BC-chains
inferred← citeshttps://doi.org/10.1007/bf03037471openalex-snapshot
Lazy debugging of lazy functional programs
inferred← citeshttps://doi.org/10.1007/bfb0014971openalex-snapshot
A compositive abstraction algorithm for combinatory logic
inferred← citeshttps://doi.org/10.1007/s10817-007-9085-yopenalex-snapshot
Translating Higher-Order Clauses to First-Order Clauses
inferred← citeshttps://doi.org/10.1007/s10817-021-09613-zopenalex-snapshot
Making Higher-Order Superposition Work
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90014-xopenalex-snapshot
A linear space translation of functional programs to Turner combinators
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90066-3openalex-snapshot
Translation of Turner Combinators in O(n log n) space
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90161-xopenalex-snapshot
Variable abstraction in O(n log n) space
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90183-9openalex-snapshot
A set of combinators for abstraction in linear space
inferred← citeshttps://doi.org/10.1016/0096-0551(83)90004-8openalex-snapshot
The use of combinators in translating a purely functional language to low-level data-flow graphs
inferred← citeshttps://doi.org/10.1016/0096-0551(85)90017-7openalex-snapshot
Efficient combinator code
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90007-kopenalex-snapshot
Functional languages: A performance study
inferred← citeshttps://doi.org/10.1016/0165-6074(89)90117-8openalex-snapshot
Microprogrammed implementation of a reduction machine
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90076-3openalex-snapshot
Complexity of the combinator reduction machine
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90004-6openalex-snapshot
A safe approach to parallel combinator reduction
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90143-6openalex-snapshot
Abstraction problems in combinatory logic: A compositive approach
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90155-bopenalex-snapshot
Functional completeness of the mixed λ-calculus and combinatory logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90306-zopenalex-snapshot
Intersection types for combinatory logic
inferred← citeshttps://doi.org/10.1016/0743-1066(84)90012-8openalex-snapshot
An extension of lambda-calculus for functional programming
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50012-7openalex-snapshot
A distributed model of computation for combinatory code
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.02.011openalex-snapshot
Criteria for Bracket Abstractions Design
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)80087-9openalex-snapshot
What is a model of the lambda calculus?
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80047-xopenalex-snapshot
Categorical combinators
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00040-6openalex-snapshot
cβ-machine with λβ-reduction
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80009-3openalex-snapshot
Functional programming with combinators
inferred← citeshttps://doi.org/10.1017/s0956796823000084openalex-snapshot
A correct-by-construction conversion from lambda calculus to combinatory logic
inferred← citeshttps://doi.org/10.1017/s0956796897002888openalex-snapshot
On combinatory complete sets of proper combinators
inferred← citeshttps://doi.org/10.1109/32.24702openalex-snapshot
Comparing two functional programming systems
inferred← citeshttps://doi.org/10.1109/empdp.1996.500618openalex-snapshot
Parallel graph reduction with the PACE architecture
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89500openalex-snapshot
Exploitation fine-grain parallelism in a combinator-based functional system
inferred← citeshttps://doi.org/10.1109/iccl.1990.63759openalex-snapshot
Cache performance of combinator graph reduction
inferred← citeshttps://doi.org/10.1109/lca.2022.3198844openalex-snapshot
Structured Combinators for Efficient Graph Reduction
inferred← citeshttps://doi.org/10.1109/mahc.1984.10040openalex-snapshot
Highlights of the History of the Lambda-Calculus
inferred← citeshttps://doi.org/10.1109/mascot.1996.501010openalex-snapshot
The design and simulation of the PACE prototype architecture
inferred← citeshttps://doi.org/10.1142/9789812770837_0014openalex-snapshot
Binary Lambda Calculus and Combinatory Logic
inferred← citeshttps://doi.org/10.1145/128861.128867openalex-snapshot
Cache behavior of combinator graph reduction
inferred← citeshttps://doi.org/10.1145/24714.24720openalex-snapshot
Combinatory code and a parallel packet-based computational model
inferred← citeshttps://doi.org/10.1145/267959.269967openalex-snapshot
Combinatory formulations of concurrent languages
inferred← citeshttps://doi.org/10.1145/276393.276397openalex-snapshot
A systematic study of functional language implementations
inferred← citeshttps://doi.org/10.1145/2854065.2854069openalex-snapshot
Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions
inferred← citeshttps://doi.org/10.1145/2993.357241openalex-snapshot
Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
inferred← citeshttps://doi.org/10.1145/319838.319855openalex-snapshot
Mechanisms for efficient multiprocessor combinator reduction
inferred← citeshttps://doi.org/10.1145/3520306.3534504openalex-snapshot
Combinatory logic and combinators in array languages
inferred← citeshttps://doi.org/10.1145/356869.356873openalex-snapshot
Data-Driven and Demand-Driven Computer Architecture
inferred← citeshttps://doi.org/10.1145/3636362.3636367openalex-snapshot
Complete and Efficient Higher-Order Reasoning via Lambda-Superposition
inferred← citeshttps://doi.org/10.1145/44326.44333openalex-snapshot
Implementing functional languages on a combinator-based reduction machine
inferred← citeshttps://doi.org/10.1145/62678.62714openalex-snapshot
Graphinators and the duality of SIMD and MIMD
inferred← citeshttps://doi.org/10.1145/73141.74828openalex-snapshot
A fresh look at combinator graph reduction
inferred← citeshttps://doi.org/10.1145/74818.74828openalex-snapshot
A fresh look at combinator graph reduction
inferred← citeshttps://doi.org/10.1145/800017.800523openalex-snapshot
A combinator-based compiler for a functional language
inferred← citeshttps://doi.org/10.1145/800068.802130openalex-snapshot
A fixed-program machine for combinator expression evaluation
inferred← citeshttps://doi.org/10.1145/800068.802145openalex-snapshot
An investigation of the relative efficiencies of combinators and lambda expressions
inferred← citeshttps://doi.org/10.1305/ndjfl/1040248462openalex-snapshot
NP-Completeness of a Combinator Optimization Problem
inferred← citeshttps://doi.org/10.1515/9783110325461.518openalex-snapshot
Church’s Thesis and Functional Programming
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:25)2015openalex-snapshot
Ellipses and Lambda Definability
inferred← citeshttps://doi.org/10.2307/2274655openalex-snapshot
Some improvements to Turner's algorithm for bracket abstraction
inferred← citeshttps://doi.org/10.2307/2275570openalex-snapshot
Compact bracket abstraction in combinatory logic
inferred← citeshttps://doi.org/10.31274/rtd-180813-8622openalex-snapshot
Combinators as control mechansims in multiprocessor systems
inferred← citeshttps://doi.org/10.31274/rtd-180813-9005openalex-snapshot
Controlling fine-grain non-numeric parallelism on a combinator-based multiprocessor system
inferred← citeshttps://doi.org/10.31274/rtd-180813-9330openalex-snapshot
Efficient list manipulation in combinator-based functional languages on parallel architectures
inferred← citeshttps://doi.org/10.3233/fi-2014-1065openalex-snapshot
DNA Tiles, Wang Tiles and Combinators
inferred← citeshttps://doi.org/10.32920/25412854openalex-snapshot
A Combinator, N-dimensional Array Library in Smalltalk
inferred← citeshttps://doi.org/10.32920/25412854.v1openalex-snapshot
A Combinator, N-dimensional Array Library in Smalltalk
inferred← citeshttps://doi.org/10.4204/eptcs.199.4openalex-snapshot
Control Flow Analysis for SF Combinator Calculus
inferred← citeshttps://doi.org/10.4467/20842589rm.18.002.8835openalex-snapshot
On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
inferred← citeshttps://doi.org/10.48456/tr-75openalex-snapshot
Design and implementation of a simple typed language based on the lambda-calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1510.03794openalex-snapshot
On the equivalence of different presentations of Turner's bracket abstraction algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1910.03217openalex-snapshot
Understanding the Expressive Power of Unhygienic Substitution in Metaprogramming via Combinatory Logic
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4566openalex-snapshot
Now f is continuous (exercise!)
inferred← citeshttps://doi.org/10.7146/dpb.v20i344.6574openalex-snapshot
What is an Efficient Implementation of the lambda-calculus?
inferred← citeshttps://doi.org/10.82444/warw.33641566openalex-snapshot
Parallel combinator reduction : some performance bounds
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.