Supercombinator

A supercombinator is a mathematical expression which is fully bound and self-contained. It may be either a constant or a combinator where all the…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We present a technique for compiling lambda-calculus expressions into SKI combinators. Unlike the well-known bracket abstraction…

2017

In this paper we discuss the possibility of super-combinator driven grammar reconstruction. We present the way how to reconstruct…

2016

Grammars might be used for various other aspects, than just to represent a language. Grammar inference is a large field which…

2016

We combine a prior incomplete deadlock-freedom-checking approach with two new reachability techniques to create a more precise…

2015

We introduce the principles of symbolization and conceptualization of perceived reality. We show them as processes that are…

2014

In previous work [27, 26] the author defined a notion of CSP-like operational semantics whose main restrictions were the…

2012

1987

1986

This paper gives a brief description of an abstract machine into which supercombinators may be compiled.

1985

Graph reduction has emerged as a poverful implementation model for lazy functional languages, especially for parallel machines…