We extend Kobayashi and Sumii's type system for the deadlock-free -calculus and develop a type reconstruction algorithm. Kobayashi and Sumii's type system helps high-level reasoning about concurrent programs by guaranteeing that communication on certain channels will eventually succeed. It can ensure, for example, that a process implementing a function really behaves like a function. However, b...

A system equation with certain properties describes implicitly function sets as the basis for an optimal design of a digital circuit. A necessary condition for the realization of a digital circuit is that the associated system equation is resolvable [2], [4]. This paper shows how the resolvability of the system equation can be checked and how the explicit description of the circuit functions ca...

This paper describes a compiler system for automatic par-allelization, partitioning, and scheduling of real-time signal processing applications written in a functional language running on general-purpose hardware. The high performance levels achieved by commodity processors can meet the demands of many real-time signal processing applications ; however, they are not used eeectively in practice ...

H1-conforming Galerkin methods on polygonal meshes such as VEM, BEM-FEM and Trefftz-FEM employ local finite element functions that are implicitly defined solutions of Poisson problems having polynomial source boundary data. Recently, have been extended to allow for mesh cells curvilinear polygons. Such extensions present new challenges determining suitable quadratures. We describe an approach i...

Variationists have largely, though often implicitly, subscribed to a model of social cognition that characterizes complex social reasoning as conscious and deliberative (e.g. the sociolinguistic monitor), in opposition to rapid and automatic linguistic behaviors (e.g. the vernacular). This paper argues against that assumption, presenting evidence from the field of social cognition which documen...