Zobrazeno 1 - 10
of 327
pro vyhledávání: '"Pfenning, Frank"'
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has been defined
Externí odkaz:
http://arxiv.org/abs/2402.01428
Autor:
Chen, Zhibo, Pfenning, Frank
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to higher-order ration
Externí odkaz:
http://arxiv.org/abs/2312.07263
Autor:
Somayyajula, Siva, Pfenning, Frank
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 3 - Proceedings of MFPS XXXIX (November 23, 2023) entics:12286
Type refinements combine the compositionality of typechecking with the expressivity of program logics, offering a synergistic approach to program verification. In this paper we apply dependent type refinements to SAX, a futures-based process calculus
Externí odkaz:
http://arxiv.org/abs/2309.08581
We study the interaction of structural subtyping with parametric polymorphism and recursively defined type constructors. Although structural subtyping is undecidable in this setting, we describe a notion of parametricity for type constructors and the
Externí odkaz:
http://arxiv.org/abs/2307.13661
Autor:
DeYoung, Henry, Pfenning, Frank
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 1 - Proceedings of MFPS XXXVIII (February 22, 2023) entics:10507
The specifics of data layout can be important for the efficiency of functional programs and interaction with external libraries. In this paper, we develop a type-theoretic approach to data layout that could be used as a typed intermediate language in
Externí odkaz:
http://arxiv.org/abs/2212.06321
Autor:
Chen, Zhibo, Pfenning, Frank
Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof systems in such
Externí odkaz:
http://arxiv.org/abs/2210.06663
Polarization of types in call-by-push-value naturally leads to the separation of inductively defined observable values (classified by positive types), and coinductively defined computations (classified by negative types), with adjoint modalities medi
Externí odkaz:
http://arxiv.org/abs/2201.10998
Autor:
Somayyajula, Siva, Pfenning, Frank
In sequential functional languages, sized types enable termination checking of programs with complex patterns of recursion in the presence of mixed inductive-coinductive types. In this paper, we adapt sized types and their metatheory to the concurren
Externí odkaz:
http://arxiv.org/abs/2105.06024
The importance of subtyping to enable a wider range of well-typed programs is undeniable. However, the interaction between subtyping, recursion, and polymorphism is not completely understood yet. In this work, we explore subtyping in a system of nest
Externí odkaz:
http://arxiv.org/abs/2103.15193