Results 1 
2 of
2
A COMBINATORY ACCOUNT OF INTERNAL STRUCTURE
"... Abstract. Traditional combinatory logic is able to represent all Turing computable functions on natural numbers, but there are effectively calculable functions on the combinators themselves that cannot be so represented, because they have direct access to the internal structure of their arguments. S ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Traditional combinatory logic is able to represent all Turing computable functions on natural numbers, but there are effectively calculable functions on the combinators themselves that cannot be so represented, because they have direct access to the internal structure of their arguments. Some of this expressive power is captured by adding a factorisation combinator. It supports structural equality, and more generally, a large class of generic queries for updating of, and selecting from, arbitrary structures. The resulting combinatory logic is structure complete in the sense of being able to represent patternmatching functions, as well as simple abstractions. §1. Introduction. Traditional combinatory logic [21, 4, 10] is computationally equivalent to pure λcalculus [3] and able to represent all of the Turing computable functions on natural numbers [23], but there are effectively calculable functions on the combinators themselves that cannot be so represented, as they examine the internal structure of their arguments.
Multipolymorphic programming in bondi (extended version)
"... Abstract. The bondi programming language is multipolymorphic, in that it supports four polymorphic programming styles within a small core of computation, namely a typed pattern calculus. bondi’s expressive power is illustrated by considering the problem of assigning reviewers to a paper. As the con ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The bondi programming language is multipolymorphic, in that it supports four polymorphic programming styles within a small core of computation, namely a typed pattern calculus. bondi’s expressive power is illustrated by considering the problem of assigning reviewers to a paper. As the context generalises from a committee to a committee with additional reviewers, to a conference, a federation or confederation, the solution incorporates polymorphism familiar from the functional, generic functional, relational, pathbased and objectoriented programming styles, respectively. These experiments show that multipolymorphic programming is both practical and desirable. 1