Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Many distributed systems rely on token structures for their correct operation. Often, these structures make sure that a fixed… 
2015
2015
We introduce the principles of symbolization and conceptualization of perceived reality. We show them as processes that are… 
2014
2014
In previous work [27, 26] the author defined a notion of CSP-like operational semantics whose main restrictions were the… 
2012
2012
1997
1997
We present TEA, a tool that is able to detect termination of functions written in a non-strict high-level functional programming… 
Highly Cited
1995
Highly Cited
1995
We present the first profiler for a compiled, non-strict, higher-order, purely functional language capable of measuring time as… 
1990
1990
The usual way for integrating strict and lazy evaluation in functional programming is the introduction of an explicit “freeze… 
1989
1987
1987
  • R. Bird
  • Sci. Comput. Program.
  • 1987
  • Corpus ID: 7377548