Traditional combinatory logic uses combinators S and K to represent all Turing-computable functions on natural numbers, but there are Turing-computable functions on the combinators themselves thatâ€¦ (More)

Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives computation by matching a pattern against a data structure. Byâ€¦ (More)

Concurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching toâ€¦ (More)

This extended abstract describes a small typed pattern calculus that is able to support four styles of polymorphism, namely, data (or parametric) polymorphism [6], structure polymorphism [4], pathâ€¦ (More)

The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calculus derive from allowing anyâ€¦ (More)

Shape theory is a new approach to data types and programming based on the separation of a data type into its \shape" and \data" parts. Shape is common in parallel computing. This paper identi esâ€¦ (More)

The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in which equality is not definable, such as the Î»-models underpinningâ€¦ (More)

SystemF is ubiquitous in logic, theorem proving, language metatheory, compiler intermediate languages, and elsewhere. A long with its type abstractions come type applications , but these often appearâ€¦ (More)