We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Software Engineering/A modular construction of type theories

Checking your access to this record.

Abstract & Overview

The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a sub-theory of U corresponding to each of these systems, and prove that, when a proof in U uses only symbols of a sub-theory, then it is a proof in that sub-theory.

Cite this record

Frédéric Blanqui, Gilles Dowek, Emilie Grienenberger, Gabriel Hondet, François Thiré (2023). A modular construction of type theories. Logical Methods in Computer Science e.V.. https://library.shubhaarti.in/content/676a8232-e980-463a-99f3-4dfa076910bf

Copy in another style

Blanqui, F., Dowek, G., Grienenberger, E., Hondet, G., & Thiré, F. (2023). A modular construction of type theories. Logical Methods in Computer Science e.V.. https://library.shubhaarti.in/content/676a8232-e980-463a-99f3-4dfa076910bf
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.