Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Nuprl"'
Autor:
RAHLI, VINCENT, BICKFORD, MARK
Publikováno v:
Mathematical Structures in Computer Science; Jun2018, Vol. 28 Issue 6, p942-990, 49p
Autor:
Kamareddine, Fairouz, Laan, Twan
Publikováno v:
Journal of Logic, Language, and Information, 2001 Jul 01. 10(3), 375-402.
Externí odkaz:
https://www.jstor.org/stable/40180289
Publikováno v:
Journal of the ACM. 66:1-35
Powerful yet effective induction principles play an important role in computing, being a paramount component of programming languages, automated reasoning, and program verification systems. The Bar Induction (BI) principle is a fundamental concept of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d54c905574219bd67b7b4bf36bc3afc9
https://doi.org/10.1145/3305261
https://doi.org/10.1145/3305261
Autor:
Liron Cohen
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
CiE
Church–Turing computability, which is the standard notion of computation, is based on functions for which there is an effective method for constructing their values. However, intuitionistic mathematics, as conceived by Brouwer, extends the notion o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c6884a4c77bab9918ca058197f2e995
https://doi.org/10.1007/978-3-030-80049-9_12
https://doi.org/10.1007/978-3-030-80049-9_12
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 124:100713
Moessner's theorem describes a procedure for generating a sequence of n integer sequences that lead unexpectedly to the sequence of nth powers 1 n , 2 n , 3 n , … . Several generalizations of Moessner's theorem exist. Recently, Kozen and Silva gave
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d56cab9caccf931a9efe5426033ea59
https://doi.org/10.1016/j.jlamp.2021.100713
https://doi.org/10.1016/j.jlamp.2021.100713
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 85:175-192
Constructions are central to the methodology of geometry presented in the Elements. This theory therefore poses a unique challenge to those concerned with the practice of constructive mathematics: can the Elements be faithfully captured in a modern c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2e212aa1ecfc54b4bd9954d8d1c2d32
https://doi.org/10.1007/s10472-018-9603-0
https://doi.org/10.1007/s10472-018-9603-0
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Vincent Rahli, Mark Bickford
Publikováno v:
Mathematical Structures in Computer Science. (2017).
This paper extends the Nuprl proof assistant (a system representative of the class of extensional type theories with dependent types) withnamed exceptionsandhandlers, as well as a nominalfreshoperator. Using these new features, we prove a version of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31a264b6f65d327a2a34ebc350555beb
https://doi.org/10.1017/s0960129517000172
https://doi.org/10.1017/s0960129517000172
Publikováno v:
Science of Computer Programming. Elsevier Science (2017).
Distributed programs are known to be extremely difficult to implement, test, verify, and maintain. This is due in part to the large number of possible unforeseen interactions among components, and to the difficulty of precisely specifying what the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad56a5390e2f8f3d6b560274dcb577d5
https://doi.org/10.1016/j.scico.2017.05.009
https://doi.org/10.1016/j.scico.2017.05.009
Autor:
CHRISTOPH KREITZ
Publikováno v:
Journal of Functional Programming; Jan2004, Vol. 14 Issue 1, p21-68, 48p