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…

2014

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

2012

In this thesis we investigate the construction of transaction processing systems using functional programming languages. The…

1997

1996

When a new programming language or programming paradigm is devised, it is essential to investigate its possibilities and give…

1996

In light of the usual deenition of values 15] as terms in weak head normal form (WHNF), a-abstraction is regarded as a value, and…

1996

reduction: approximation: e; e! # e0 ej e0 C[e]; e nf-terminates C[e] j C[Te] context-skip: branching: f e1 : : : en; (f nf…

1995

required to think at two completely different levels of concern. We therefore advocate a fine-grained approach to parallelism and…

1994

from the practical issues discussed in section 6.3, several others research directions like the application of this approach to…

1992

함수 언어의 구현에서 중요한 문제점 중의 하나는 실행 속도이다. 실행 속도를 높이기 위해 supercombinator, strict analysis…