Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
2016
2016
Grammars might be used for various other aspects, than just to represent a language. Grammar inference is a large field which… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • table III
2015
2015
We introduce the principles of symbolization and conceptualization of perceived reality. We show them as processes that are… Expand
  • table I
  • figure 2
  • figure 4
2014
2014
In previous work [27, 26] the author defined a notion of CSP-like operational semantics whose main restrictions were the… Expand
1997
1997
We present TEA, a tool that is able to detect termination of functions written in a non-strict high-level functional programming… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
1993
1993
The notion of continuation is ubiquitous in many different areas of computer science, including logic, constructive mathematics… Expand
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • figure 1
1992
1992
This paper describes a new approach for debugging lazy functional languages. It rests on the fact that a functional program is… Expand
  • figure 1
  • table 1
1990
1990
The usual way for integrating strict and lazy evaluation in functional programming is the introduction of an explicit “freeze… Expand