2 citations · 2 across the 2 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2023
Dependent Type Refinements for Futures
Siva Somayyajula, Frank Pfenning
Type refinements combine the compositionality of typechecking with the expressivity of program logics, offering a synergistic approach to program verification. In this paper we app…
cs.PL2021
Type-Based Termination for Futures
Siva Somayyajula, Frank Pfenning
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…