Combinatory logic and lambda-calculus, originally devised in the 1920s, have since
developed into linguistic tools, especially useful in programming languages. The authors' …

We are interested in learning programs for multiple related tasks given only a few training
examples per task. Since the program for a single task is underdetermined by its data, we …

Computational semantics is the art and science of computing meaning in natural language.
The meaning of a sentence is derived from the meanings of the individual words in it, and …

Technical artifacts are taken to include all the common objects of everyday life, such as
chairs, televisions, paper clips, telephones, smartphones and dog collars. They are material …

A Concise Introduction to Computation Models and Computability Theory provides an
introduction to the essential concepts in computability, using several models of computation …

The philosophy of computer science is concerned with the ontological and methodological
issues arising from within the academic discipline of computer science, and from the practice …

We propose an entropic geometrical model of crowd behavior dynamics (with dissipative
crowd kinematics), using Feynman action-amplitude formalism that operates on three …

We show that the full PCF language can be encoded in L _rec, a syntactically linear λ-
calculus extended with numbers, pairs, and an unbounded recursor that preserves the …

In this thesis we investigate the semantics of concurrent programming languages with
respect to the correctness of program transformations which occur during compilation of …

Most of the mainstream general-purpose programming languages support lambda
expressions. In some languages (JavaScript, Swift) lambda expressions are called …