Zobrazeno 1 - 10
of 320
pro vyhledávání: '"Type constructor"'
Autor:
James Laird
Publikováno v:
MFPS
We describe a type theory or metalanguage for constructing and reasoning about higher-order programs with global and local state, and its categorical model. This provides an encapsulation primitive for abstracting global state and making it local to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9738f4b020c95811d3fbda8f8a62812f
https://doi.org/10.1016/j.entcs.2019.09.011
https://doi.org/10.1016/j.entcs.2019.09.011
When designing languages for functional reactive programming (FRP) the main challenge is to provide the user with a simple, flexible interface for writing programs on a high level of abstraction while ensuring that all programs can be implemented eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::395e338560671759e26118d2cd376559
http://arxiv.org/abs/2003.03170
http://arxiv.org/abs/2003.03170
Autor:
Pieter Koopman, Rinus Plasmeijer
Publikováno v:
IFL
Parser combinators offer a concise and fast way to produce reasonably efficient parsers. The combinator libraries themselves can be small and provide an elegant application of functional programming techniques. They are one of the success stories in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d33de689a18bcd9c806e4577ebef02d9
https://doi.org/10.1145/3412932.3412938
https://doi.org/10.1145/3412932.3412938
Autor:
Andrew Polonsky, Patricia Johann
Publikováno v:
LICS
We present a grammar for a robust class of data types that includes algebraic data types (ADTs), (truly) nested types, generalized algebraic data types (GADTs), and their higher-kinded analogues. All of the data types our grammar defines, as well as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c4cbcd43d7e9321a381eea0a8188e3f
https://doi.org/10.1109/lics.2019.8785657
https://doi.org/10.1109/lics.2019.8785657
Autor:
Miloš Kosterec
Publikováno v:
Synthese. 194:5005-5021
In this paper, I investigate type theories (TTs) from several perspectives. First, I present and elaborate the philosophical and technical motivations for these theories. I then offer a formal analysis of various TTs, focusing on the cardinality of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5620d50f04f37151ec9e1570eab8f4a9
https://doi.org/10.1007/s11229-016-1190-1
https://doi.org/10.1007/s11229-016-1190-1
Autor:
Sukyoung Ryu
Publikováno v:
ACM Transactions on Programming Languages and Systems. 38:1-66
In object-oriented programs, objects often provide methods whose parameter types or return types are the object types themselves. For example, the parameter types of binary methods are the types of their receiver objects, and the return types of some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa66a784534a0fc3e62264f2e17fc86e
https://doi.org/10.1145/2888392
https://doi.org/10.1145/2888392
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030223472
Models, Mindsets, Meta
Models, Mindsets, Meta
In this paper we figure out the future of intersection types in Java developments, based both on the primary meaning of the intersection type constructor and on the present approach in Java. In our vision, the current use of intersection types will b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02aedf4c72dcd5c0c929e1912232a140
https://doi.org/10.1007/978-3-030-22348-9_6
https://doi.org/10.1007/978-3-030-22348-9_6
Publikováno v:
PPDP
We develop an interpretation of linear type theory as dependent session types for a term passing extension of the pi-calculus. The type system allows us to express rich constraints on sessions, such as interface contracts and proof-carrying certifica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84075953a001688bfd6f6889da167605
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
Principles and Practice of Declarative Programming, PPDP'12
Principles and Practice of Declarative Programming, PPDP'12, 2012, Unknown, pp.139--150
Information and Computation, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
PPDP
Information and Computation, Elsevier, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
Principles and Practice of Declarative Programming, PPDP'12
Principles and Practice of Declarative Programming, PPDP'12, 2012, Unknown, pp.139--150
Information and Computation, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
PPDP
International audience; Session types are a formalism to model structured communication-based programming. A session type describes communication by specifying the type and direction of data exchanged between two parties. When session types and sessi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84d59e39fd576b8b5c0b707ca4fe8624
https://hal.inria.fr/hal-01647086
https://hal.inria.fr/hal-01647086
Autor:
Giuseppe Castagna, Victor Lanvin
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2017, 1 (ICFP), pp.1-28. ⟨10.1145/3110285⟩
Proceedings of the ACM on Programming Languages, ACM, 2017, 1 (ICFP), pp.1-28. ⟨10.1145/3110285⟩
We propose a type system for functional languages with gradual types and set-theoretic type connectives and prove its soundness. In particular, we show how to lift the definition of the domain and result type of an application from non-gradual types
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31318a663983c59acaa1903b25c56d9f
https://hal.archives-ouvertes.fr/hal-01643309
https://hal.archives-ouvertes.fr/hal-01643309