Results 251 to 260 of about 173,804,276 (284)

ECC, an extended calculus of constructions

[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 2003
A higher-order calculus ECC (extended calculus of constructions) is presented which can be seen as an extension of the calculus of constructions by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics may be adequately ...
openaire   +1 more source

Inductive Consequences in the Calculus of Constructions

2010
Extending the calculus of constructions with rewriting would greatly improve the efficiency of proof assistants such as Coq. In this paper we address the issue of the logical power of such an extension. In our previous work we proposed a procedure to check completeness of user-defined rewrite systems.
Daria Walukiewicz-Chrzaszcz, Jacek Chrzaszcz   +1 more
openaire   +1 more source

Partial objects in the calculus of constructions

[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 2002
A typed framework for working with nonterminating computations is provided. The basic system is the calculus of constructions. It is extended using an original idea proposed by R. Constable and S.F. Smith (2nd Ann. IEEE Conf. on Logic in Comput. Sci., 1987) and implemented in Nuprl.
openaire   +1 more source

A constructive sequence algebra for the calculus of indications

Soft Computing, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rocco Gangle, Gianluca Caterina, Fernando Tohmé   +2 more
openaire   +4 more sources

Extensional Set Equality in the Calculus of Constructions

Journal of Logic and Computation, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

CONSTRUCTIVE CLASSICAL LOGIC AS CPS-CALCULUS

International Journal of Foundations of Computer Science, 2000
We establish the Curry-Howard isomorphism between constructive classical logic and [Formula: see text]-calculus. [Formula: see text]-calculus exactly means the target language of Continuation Passing Style (CPS) transforms. Constructive classical logic we refer to are LKT and LKQ introduced by Danos et al.(1993).
openaire   +3 more sources

Explicit Universes for the Calculus of Constructions

2002
The implicit universe hierarchy implemented in proof assistants such as Coq and Lego, although really needed, is painful, both for the implementer and the user: it interacts badly with modularity features, errors are difficult to report and to understand. Moreover, type-checking is quite complex.We address these issues with a new calculus, the Explicit
openaire   +2 more sources

Construction of fractal calculus

SCIENTIA SINICA Mathematica, 2015
A fractal function does not have the derivatives in Newton sense, however, it still represents some kind of motion and then certainly it has velocity (rate of change). How to construct fractal calculus in order to describe the velocity of a fractal function is a challenging and important problem.
openaire   +1 more source

A Calculus of Inductive Linear Constructions

Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development, 2023
Qiancheng Fu, Hongwei Xi 0001
openaire   +2 more sources

A full formalisation of π-calculus theory in the calculus of constructions

1997
A formalisation of π-calculus in the Coq system is presented. Based on a de Bruijn notation for names, our implementation exploits the mechanisation of some proof techniques described by Sangiorgi in [San95b] to derive several results of classical π-calculus theory, including congruence, structural equivalence and the replication theorems.
openaire   +1 more source