~ similar to 2608.12409· 20 results
This paper presents a polymorphic calculus with first-class environments that conservatively extends System F with a small-step environment semantics.
This paper defines a graph-based operational semantics and type system for Vega, a declarative language for creating interactive data visualizations.
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
Mechanising denotational semantic definitions of programming languages in Agda with minimal reformulation.
This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.
The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.
The paper shows that the λ-calculus can be made to automatically perform dynamic programming without the need for memoization or recursion constructs.
The paper develops Algebraic Architecture Theory (AAT) to determine what changes to AI-generated software preserve and which alternatives remain.
This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.
Zhiqiang Yuan, Chong Wang, Zhenhao Zhou, Junwei Liu +1 more
This paper studies the performance gap between C and Rust code generated by a transpiler and proposes an LLM-based approach to recover the performance of translated Rust.
Wenhao Tang, Shengyi Jiang, Aghilas Y. Boussaa, Sam Lindley +1 more
The paper proposes Fresco, a novel bidirectional type inference approach for first-class polymorphism that enables local type information to flow back and forth between functions and arguments.
This paper reports on SciGMark 1.5, a benchmark study of specialized and generic implementations in modern languages, examining the consequences of various generic-realization strategies and extending…
A novel calculus is introduced that models first-class environments and function application using standard record types.
The paper proposes a generic memory framework for advanced static program analysis, supporting various memory behaviors from different programming languages using Abstract Interpretation theory.
The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…
This paper introduces the because-calculus, a calculus that structurally separates registration and attestation using dual effect rows and level-indexed typing, and proves the Conflation Theorem.
The paper proposes integrating dependent pattern matching into the unification process in dependently typed languages to synthesize functions defined by case analysis, addressing the limitation of exi…