Zobrazeno 1 - 10
of 547
pro vyhledávání: '"Curry-style"'
Publikováno v:
ACM Transactions on Programming Languages & Systems. Mar2019, Vol. 41 Issue 1, p1-58. 58p.
Autor:
De Lataillade, Joachim
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:
http://arxiv.org/abs/0705.4228
Autor:
Compagnoni, Adriana, Goguen, Healfdene
Publikováno v:
EPTCS 45, 2011, pp. 1-15
Type theories with higher-order subtyping or singleton types are examples of systems where computation rules for variables are affected by type information in the context. A complication for these systems is that bounds declared in the context do not
Externí odkaz:
http://arxiv.org/abs/1101.4423
Autor:
Fujita, Ken-etsu, Schubert, Aleksy
Publikováno v:
In Theoretical Computer Science 11 September 2014 549:17-35
Autor:
Laird, James
Publikováno v:
Foundations of Software Science and Computation Structures
We propose a “Curry-style” semantics of programs in which a nominal labelled transition system of types, characterizing observable behaviour, is overlaid on a nominal LTS of untyped computation. This leads to a notion of program equivalence as ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::c5cf4ebd36c6018b1a15543d7bc3257b
http://europepmc.org/articles/PMC7788620
http://europepmc.org/articles/PMC7788620
Autor:
Adriana Compagnoni, Healfdene Goguen
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 45, Iss Proc. ITRS 2010, Pp 1-15 (2011)
Type theories with higher-order subtyping or singleton types are examples of systems where computation rules for variables are affected by type information in the context. A complication for these systems is that bounds declared in the context do not
Externí odkaz:
https://doaj.org/article/a6c922935103473a951dde71a832d136
Autor:
Christophe Raffalli, Rodolphe Lepigre
Publikováno v:
ACM Transactions on Programming Languages and Systems. 41:1-58
We present a new, syntax-directed framework for Curry-style type systems with subtyping. It supports a rich set of features, and allows for a reasonably simple theory and implementation. The system we consider has sum and product types, universal and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ddab98b91493fed7c78d906afbbd059
https://doi.org/10.1145/3285955
https://doi.org/10.1145/3285955
Autor:
Laird, James
Publikováno v:
Laird, J 2020, A Curry-style Semantics of Interaction : From Untyped to Second-Order Lazy λμ-Calculus . in J Goubault-Larrecq & B König (eds), Foundations of Software Science and Computation Structures-23rd International Conference, FOSSACS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings . Lecture Notes in Computer Science, vol. 12077, Springer, Cham, Switzerland, pp. 422-441, 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, 25/04/20 . https://doi.org/10.1007/978-3-030-45231-5_22
We propose a “Curry-style” semantics of programs in which a nominal labelled transition system of types, characterizing observable behaviour, is overlaid on a nominal LTS of untyped computation. This leads to a notion of program equivalence as ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1378::407a3d4a28b53ecdd2d52904998cf2aa
https://purehost.bath.ac.uk/ws/files/205714908/fos20.pdf
https://purehost.bath.ac.uk/ws/files/205714908/fos20.pdf
Autor:
James Laird
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030452308
FoSSaCS
FoSSaCS
We propose a “Curry-style” semantics of programs in which a nominal labelled transition system of types, characterizing observable behaviour, is overlaid on a nominal LTS of untyped computation. This leads to a notion of program equivalence as ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a09f31332c76f8e30181c7d0b4351f36
https://doi.org/10.1007/978-3-030-45231-5_22
https://doi.org/10.1007/978-3-030-45231-5_22
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