Sciweavers

3583 search results - page 3 / 717
» A Type System for the Relational Calculus of Object Systems
Sort
View
ECOOP
1998
Springer
13 years 10 months ago
On Object Extension
The last few years have seen the development of statically typed object based (also called prototype-based) programming languages. Two proposals, namely the Lambda Calculus of Obje...
Luigi Liquori
TLCA
2007
Springer
14 years 10 days ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
ENTCS
2000
80views more  ENTCS 2000»
13 years 6 months ago
The simply typed rewriting calculus
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
Horatiu Cirstea, Claude Kirchner
ENTCS
2002
128views more  ENTCS 2002»
13 years 6 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
JLP
2010
142views more  JLP 2010»
13 years 1 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer