E192-04 - Forschungsbereich Formal Methods in Systems Engineering
-
Date (published):
31-Jul-2022
-
Event name:
Women In Logic
en
Event date:
31-Jul-2022
-
Event place:
Haifa, Israel
-
Keywords:
Type theory
en
Abstract:
When using type theories in proof assistants the full syntax can quickly become too verbose to handle. One common solution to this problem is to design two type theories: a fully annotated type theory which has good meta-theoretic properties, is suitable for algorithmic processing and resides in the kernel of the proof assistant, and an economic one for the users’ input. The two theories are linked by elaboration, a reconstruction of missing information that happens during, or in parallel with, type-checking. We define a type-theoretic account of an elaboration map and relate its algorithmic properties to decidability of type-checking.
en
Research Areas:
Mathematical and Algorithmic Foundations: 20% Computer Science Foundations: 80%
