Modal dependent type theory and dependent right adjoints
نویسندگان
چکیده
منابع مشابه
Adjoints for Time-Dependent Optimal Control
The use of discrete adjoints in the context of a hard time-dependent optimal control problem is considered. Gradients required for the steepest descent method are computed by code that is generated automatically by the differentiation-enabled NAGWare Fortran compiler. Single time steps are taped using an overloading approach. The entire evolution is reversed based on an efficient checkpointing ...
متن کاملA dependent nominal type theory
Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and ML-like polymorphic languages have been studied, but decidability and normalization results have only been established for simple nominal type...
متن کاملElaboration in Dependent Type Theory
To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary mathematical text, and resolving ambiguities in mathematical expressions. We refer to the process of passing from a quasi-formal and partially-specified expression to a...
متن کاملDependent Communication in Type Theory
We present an expressive type system for a language extending the usual λ-calculus with concurrency primitives from the π-calculus. This language uses dependent types as found in type theory, enriched with linear types for processes. It allows to define programs performing communication according to complex protocols, including possible dependencies on the communicated data. The core of this ty...
متن کاملAutomation for Dependent Type Theory
Hammers provide most powerful general purpose automation for proof assistants based on HOL and set theory today. Despite the gaining popularity of the more advanced versions of type theory, such as those based on the Calculus of Inductive Constructions, the construction of hammers for such foundations has been hindered so far by the lack of translation and reconstruction components. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2019
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129519000197