Page
%P
2 Result(s)
-
Chapter and Conference Paper
Uniformly applicative structures, a theory of computability and polyadic functions
This article describes a Computability theory developed from the theory of URS described by E.G. Wagner and H.R. Strong and a Combinatory theory named TGE presented by the authors. Its main contribution is tha...
-
Chapter and Conference Paper
A theory for natural modelisation and implementation of functions with variable arity
The aim of this article is to provide a new theorical framework based on combinators for the study and implementation of applicative programming languages. This formal theory can be viewed as a Computability t...
