Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Jan Schwinghammer"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 4 (2013)
Programming languages with countable nondeterministic choice are computationally interesting since countable nondeterminism arises when modeling fairness for concurrent systems. Because countable choice introduces non-continuous behaviour, it is well
Externí odkaz:
https://doaj.org/article/b1641a6b22a94774853055dfae99a12c
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 4 (2012)
We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two modal operators, on predicates and types, which serve as guards in recursive definitions of te
Externí odkaz:
https://doaj.org/article/5bc5287ee86c491ca6b70f696b4b6227
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 3 (2011)
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the com
Externí odkaz:
https://doaj.org/article/b3e5a2d549b1449ebfffeb5a37bcdac4
Autor:
Catalin Hritcu, Jan Schwinghammer
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 4 (2009)
Step-indexed semantic interpretations of types were proposed as an alternative to purely syntactic proofs of type safety using subject reduction. The types are interpreted as sets of values indexed by the number of computation steps for which these v
Externí odkaz:
https://doaj.org/article/c1499712fdea4cc1b05f60d3b71c053f
Autor:
Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Stovring, Jacob Thamsborg, Hongseok Yang
Over the last decade, there has been extensive research on modelling challenging features in programming languages and program logics, such as higher-order store and storable resource invariants. A recent line of work has identified a common solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2a0f8e818d8b85e0bb30503bd89ca47e
https://ora.ox.ac.uk/objects/uuid:f2d38299-0326-4633-b77e-6f5d3e7ee2ac
https://ora.ox.ac.uk/objects/uuid:f2d38299-0326-4633-b77e-6f5d3e7ee2ac
Autor:
Jan Schwinghammer
Publikováno v:
Journal of Functional Programming. 19:157-172
One approach to give semantics to languages with subtypes is by translation to target languages without subtyping: subtypingsA≤Bare interpreted via conversion functionsA→B. This paper shows how to extend the method to languages with computational
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2015, 577, pp.98-124. ⟨10.1016/j.tcs.2015.02.027⟩
Theoretical Computer Science, Elsevier, 2015, 577, pp.98-124. ⟨10.1016/j.tcs.2015.02.027⟩
Theoretical Computer Science, 2015, 577, pp.98-124. ⟨10.1016/j.tcs.2015.02.027⟩
Theoretical Computer Science, Elsevier, 2015, 577, pp.98-124. ⟨10.1016/j.tcs.2015.02.027⟩
International audience; For the issue of translations between programming languages with observational semantics, this paper clarifies the notions, the relevant questions, and the methods, constructs a general framework, and provides several tools fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3d132df4fe67df27fc6628af2a55df5
https://inria.hal.science/hal-00824349/document
https://inria.hal.science/hal-00824349/document
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2006, Theoretical Computer Science, 364 (3), pp.338-356. ⟨10.1016/j.tcs.2006:08.016⟩
Theoretical Computer Science, 2006, Theoretical Computer Science, 364 (3), pp.338-356. ⟨10.1016/j.tcs.2006:08.016⟩
Theoretical Computer Science, Elsevier, 2006, Theoretical Computer Science, 364 (3), pp.338-356. ⟨10.1016/j.tcs.2006:08.016⟩
Theoretical Computer Science, 2006, Theoretical Computer Science, 364 (3), pp.338-356. ⟨10.1016/j.tcs.2006:08.016⟩
International audience; We introduce a new lambda calculus with futures, Lambda(fut), that models the operational semantics of concurrent statically typed functional programming languages with mixed eager and lazy threads such as Alice ML, a concurre