Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Theory of computation → Higher order logic"'
We introduce a variation on Barthe et al.’s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity, differentiabilit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1392404bed30845df71b928c52674ea3
Autor:
Karayel, Emin
In 1999 Alon et al. introduced the still active research topic of approximating the frequency moments of a data stream using randomized algorithms with minimal space usage. This includes the problem of estimating the cardinality of the stream element
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f500c4c1f93d207d1932723ffa6292b
Autor:
Andronick, June, de Moura, Leonardo
LIPIcs, Volume 237, ITP 2022, Complete Volume
LIPIcs, Vol. 237, 13th International Conference on Interactive Theorem Proving (ITP 2022), pages 1-602
LIPIcs, Vol. 237, 13th International Conference on Interactive Theorem Proving (ITP 2022), pages 1-602
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3118e563421b6e25d07e581fd59952d
Autor:
Andronick, June, de Moura, Leonardo
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 237, 13th International Conference on Interactive Theorem Proving (ITP 2022), pages 0:i-0:x
LIPIcs, Vol. 237, 13th International Conference on Interactive Theorem Proving (ITP 2022), pages 0:i-0:x
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b7f2d59d513b92e7070c74ec844d0ad
Non-terminating (dependencies of) definitions can lead to logical contradictions, for example when defining a boolean constant as its own negation. Some proof assistants thus detect and disallow non-terminating definitions. Termination is generally u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1726c08a47a87c1140fc2915702b143c
Autor:
Lochbihler, Andreas
Aharoni et al. [Ron Aharoni et al., 2010] proved the max-flow min-cut theorem for countable networks, namely that in every countable network with finite edge capacities, there exists a flow and a cut such that the flow saturates all outgoing edges of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01515c4bb7c381bb38c80a035cf8aeca
Autor:
Pistone, Paolo, Tranchini, Luca
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we investigate Syst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d12775ea046bd36b3eba230c51dd7cfb
Autor:
Maggesi, Marco, Perini Brogi, Cosimo
This work presents a formalized proof of modal completeness for Gödel-Löb provability logic (GL) in the HOL Light theorem prover. We describe the code we developed, and discuss some details of our implementation. In particular, we show how we adapt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86564fbd23f0cc4be25031f5b7501f4d
http://hdl.handle.net/2158/1225580
http://hdl.handle.net/2158/1225580
Autor:
Arkor, Nathanael, McDermott, Dylan
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional algebraic st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::044180f7b0c712916ca6051442242cf5
Autor:
Myreen, Magnus O.
The CakeML project has developed a proof-producing code generation mechanism for the HOL4 theorem prover, a verified compiler for ML and, using these, a number of verified application programs that are proved correct down to the machine code that run
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f2b3413f1d840abfb0e8a1c0dc25148