Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A modular construction of type theories (2111.00543v6)

Published 31 Oct 2021 in cs.LO and math.LO

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Frédéric Blanqui (40 papers)
  2. Gilles Dowek (80 papers)
  3. Emilie Grienenberger (2 papers)
  4. Gabriel Hondet (3 papers)
  5. François Thiré (3 papers)
Citations (7)

Summary

We haven't generated a summary for this paper yet.