Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Claude Stolze"'
Session types are a well-established framework for the specification of interactions between components of a distributed systems. An important issue is how to determine the type for an open system, i.e., obtained by assembling subcomponents, some of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91283ae351221af683214fab75b02bff
https://hdl.handle.net/11390/1233165
https://hdl.handle.net/11390/1233165
Publikováno v:
Formal Aspects of Component Software ISBN: 9783030906351
FACS
FACS
We introduce partial sessions and partial (multiparty) session types, in order to deal with open systems, i.e., systems with missing components. Partial sessions can be composed, and the type of the resulting system is derived from those of its compo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24b5b44585aa368295db1ec28f277cf6
https://doi.org/10.1007/978-3-030-90636-8_3
https://doi.org/10.1007/978-3-030-90636-8_3
Autor:
Luigi Liquori, Claude Stolze
Publikováno v:
Lecture Notes in Computer Science
TTCS 2017-2nd International Conference on Topics in Theoretical Computer Science
TTCS 2017-2nd International Conference on Topics in Theoretical Computer Science, Sep 2017, Tehran, Iran. pp.74-90, ⟨10.1007/978-3-319-68953-1_7⟩
Topics in Theoretical Computer Science ISBN: 9783319689524
TTCS
TTCS 2017-2nd International Conference on Topics in Theoretical Computer Science
TTCS 2017-2nd International Conference on Topics in Theoretical Computer Science, Sep 2017, Tehran, Iran. pp.74-90, ⟨10.1007/978-3-319-68953-1_7⟩
Topics in Theoretical Computer Science ISBN: 9783319689524
TTCS
Part 3: Logic, Semantics, and Programming Theory; International audience; Using Curry-Howard isomorphism, we extend the typed lambda-calculus with intersection and union types, and its corresponding proof-functional logic, previously defined by the a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9c9785312db63ec59fc9d121baad063
https://hal.inria.fr/hal-01760641/document
https://hal.inria.fr/hal-01760641/document
Publikováno v:
11th International Workshop on Logical Frameworks and Meta-languages, LFMTP
11th International Workshop on Logical Frameworks and Meta-languages, LFMTP, Sep 2017, Oxford, United Kingdom. pp.1-9
11th International Workshop on Logical Frameworks and Meta-languages, LFMTP, Sep 2017, Oxford, United Kingdom. pp.1-9
International audience; We present an ongoing implementation of a dependent-type theory (∆-framework) based on the Edinburgh Logical Framework LF, extended with Proof-functional logical connectives such as intersection , union, and strong (or minim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8910e23b5b0ebfa54252717a1951265b
https://hal.inria.fr/hal-01534035v2/file/paper-sigconf.pdf
https://hal.inria.fr/hal-01534035v2/file/paper-sigconf.pdf
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