Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Curry-style"'
Autor:
Lepigre, Rodolphe
Publikováno v:
Programming Languages [cs.PL]. Université Grenoble Alpes, 2017. English. ⟨NNT : 2017GREAM034⟩
Computer Science [cs]. Grenoble 1 UGA-Université Grenoble Alpes, 2017. English
Computer Science [cs]. Grenoble 1 UGA-Université Grenoble Alpes, 2017. English
In recent years, proof assistant have reached an impressive level of maturity. They have led to the certification of complex programs such as compilers and operating systems. Yet, using a proof assistant requires highly specialised skills and it rema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f9d04e1169b3924484461f845dc088aa
https://tel.archives-ouvertes.fr/tel-01682908/file/LEPIGRE_2017_archivage.pdf
https://tel.archives-ouvertes.fr/tel-01682908/file/LEPIGRE_2017_archivage.pdf
Autor:
Lepigre, Rodolphe
Publikováno v:
23rd International Conference on Types for Proofs and Programs (TYPES 2017)
23rd International Conference on Types for Proofs and Programs (TYPES 2017), Jul 2017, Budapest, Hungary. pp.27, ⟨10.4230/LIPIcs.TYPES.2017.5⟩
23rd International Conference on Types for Proofs and Programs (TYPES 2017), Jul 2017, Budapest, Hungary. pp.27, ⟨10.4230/LIPIcs.TYPES.2017.5⟩
International audience; We present the PML 2 language, which provides a uniform environment for programming, and for proving properties of programs in an ML-like setting. The language is Curry-style and call-by-value, it provides a control operator (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8e1fb603002e28a2236b083a02f0b30
https://inria.hal.science/hal-01972000/document
https://inria.hal.science/hal-01972000/document
Autor:
Lepigre, Rodolphe
Publikováno v:
Computer Science [cs]. Grenoble 1 UGA-Université Grenoble Alpes, 2017. English
In recent years, proof assistant have reached an impressive level of maturity. They have led to the certification of complex programs such as compilers and operating systems. Yet, using a proof assistant requires highly specialised skills and it rema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2d97d9f59b483f814a15d9bc3b321964
https://hal.inria.fr/tel-01590363
https://hal.inria.fr/tel-01590363
Publikováno v:
Programming Languages and Systems ISBN: 9783319479576
APLAS
14th Asian Symposium on Programming Languages and Systems
14th Asian Symposium on Programming Languages and Systems, Nov 2016, Hanoi, Vietnam
APLAS
14th Asian Symposium on Programming Languages and Systems
14th Asian Symposium on Programming Languages and Systems, Nov 2016, Hanoi, Vietnam
International audience; Proof-functional logical connectives allow reasoning about the structure of logical proofs, in this way giving to the latter the status of first-class objects. This is in contrast to classical truth-functional con- nectives wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29065b641c38462bb18b445961a206f1
https://doi.org/10.1007/978-3-319-47958-3_11
https://doi.org/10.1007/978-3-319-47958-3_11
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:
Joachim De Lataillade
Publikováno v:
Mathematical Structures in Computer Science. 18:647-692
Curry-style system F, ie. system F with no explicit types in terms, can be seen as a core presentation of polymorphism from the point of view of programming languages. This paper gives a characterisation of type isomorphisms for this language, by usi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3834790038f08acc0fa34604ba19fa94
https://doi.org/10.1017/s0960129508006828
https://doi.org/10.1017/s0960129508006828
Publikováno v:
Theoretical Computer Science. 398:95-113
Intersection types are well known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type operator is a meta-level operator, that is, there is no direct logical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::227e57975374e514337d6ff306520401
https://doi.org/10.1016/j.tcs.2008.01.046
https://doi.org/10.1016/j.tcs.2008.01.046
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.
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.
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.