Cargando…
On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem
Logical relations are one among the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be immediately proved by means of logical relations, for instance...
Autores principales: | Barthe, Gilles, Crubillé, Raphaëlle, Lago, Ugo Dal, Gavazzo, Francesco |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7702265/ http://dx.doi.org/10.1007/978-3-030-44914-8_3 |
Ejemplares similares
-
Symbolic logic and mechanical theorem proving
por: Chang, Chin-Liang, et al.
Publicado: (1969) -
Symbolic logic and mechanical theorem proving
por: Chang Chin Liang, et al.
Publicado: (1973) -
First-order logic and automated theorem proving
por: Gries, David, et al.
Publicado: (1990) -
Direct and converse theorems: the elements of symbolic logic
por: Gradshtein, I S, et al.
Publicado: (1963) -
The mathematics of logic: a guide to completeness theorems and their applications
por: Kaye, Richard W
Publicado: (2007)