2272 search results - page 63 / 455 » A Calculus for |
APAL
2008
13 years 8 months ago
2008
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
ENTCS
2006
13 years 8 months ago
2006
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and...
JFP
2008
13 years 8 months ago
2008
The historical design of the call-by-value theory of control relies on the reification of evaluation contexts as regular functions and on the use of ordinary term application for ...
JCT
2006
13 years 8 months ago
2006
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich&#...