Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Andrea Condoluci"'
Autor:
Andrea Condoluci, Matteo Manighetti
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 281, Iss Proc. CL&C 2018, Pp 10-23 (2018)
The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic rules apparent
Externí odkaz:
https://doaj.org/article/5af2b3b7171643aeba603e1ac59a8496
Publikováno v:
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, Italy. pp.1-14, ⟨10.1109/LICS52264.2021.9470630⟩
LICS
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, Italy. pp.1-14, ⟨10.1109/LICS52264.2021.9470630⟩
LICS
Whether the number of beta-steps in the lambda-calculus can be taken as a reasonable time cost model (that is, polynomially related to the one of Turing machines) is a delicate problem, which depends on the notion of evaluation strategy. Since the ni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eeb3fb480fd2f39404e8cb69b430a35f
https://hal.inria.fr/hal-03475461
https://hal.inria.fr/hal-03475461
Publikováno v:
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3354169⟩
PPDP
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3354169⟩
PPDP
International audience; Extending the λ-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2bcede1f56dba259666cec004ed1430
https://hal.archives-ouvertes.fr/hal-02415766/document
https://hal.archives-ouvertes.fr/hal-02415766/document
Publikováno v:
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3354174⟩
PPDP
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3354174⟩
PPDP
International audience; The λ-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6d84a34adb907f8b881a04d223e79de
http://hdl.handle.net/11585/718235
http://hdl.handle.net/11585/718235
Autor:
Makarius Wenzel, Claudio Sacerdoti Coen, Dennis Müller, Andrea Condoluci, Michael Kohlhase, Florian Rabe
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030232498
CICM
CICM
Formal libraries are treasure troves of detailed mathematical knowledge, but this treasure is usually locked into system- and logic-specific representations that can only be understood by the respective theorem prover system. In this paper we present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::983acebdd435de9510c95cbf5f314894
https://doi.org/10.1007/978-3-030-23250-4_5
https://doi.org/10.1007/978-3-030-23250-4_5
Autor:
Matteo Manighetti, Andrea Condoluci
Publikováno v:
Seventh International Workshop on Classical Logic and Computation (CL&C 2018)
Seventh International Workshop on Classical Logic and Computation (CL&C 2018), Jul 2018, Oxford, United Kingdom. pp.10-23
Electronic Proceedings in Theoretical Computer Science, Vol 281, Iss Proc. CL&C 2018, Pp 10-23 (2018)
CL&C
Seventh International Workshop on Classical Logic and Computation (CL&C 2018), Jul 2018, Oxford, United Kingdom. pp.10-23
Electronic Proceedings in Theoretical Computer Science, Vol 281, Iss Proc. CL&C 2018, Pp 10-23 (2018)
CL&C
The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic rules apparent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33826f768c88f1a522c280f883533bc5
https://inria.hal.science/hal-01870112
https://inria.hal.science/hal-01870112