ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2608.12409· 20 results

cs.PLTheoreticalRecentOct 27, 2026

Polymorphic First-Class Environments

Jinhao Tan, Jam Kabeer Ali Khan, Bruno C. d. S. Oliveira

This paper presents a polymorphic calculus with first-class environments that conservatively extends System F with a small-step environment semantics.

View →
cs.PLTheoreticalRecentJun 12, 2026

Formal Semantics and Type System for Vega Data Transformations

Kristýna Petrlíková, Tomas Petricek

This paper defines a graph-based operational semantics and type system for Vega, a declarative language for creating interactive data visualizations.

View →
cs.PLcs.MSTheoreticalRecentOct 30, 2026

Grassmann: The Coordinate-Independent Linear Algebra Programming Language

Theadora Fields Collin, Gilbert Bernstein, Oded Stein, Saman Amarasinghe

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

View →
cs.PLTheoreticalRecentOct 10, 2026

Mechanising Denotational Semantics in Agda

Peter D. Mosses, Jesper Cockx, Bernhard Reus

Mechanising denotational semantic definitions of programming languages in Agda with minimal reformulation.

View →
cs.PLTheoreticalRecentOct 16, 2026

Arbitrary Functors as Modalities in a Linear Calculus

Jean-Philippe Bernardy, Andreas Abel

This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.

View →
cs.PLcs.CCcs.FLRecentMay 30, 2026

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation

Ezequiel López-Rubio

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.

View →
cs.PLcs.LOTheoreticalRecentJun 22, 2026

Cyclic Graphs and Memoization in Pure $λ$-Calculus

Bo Yang

The paper shows that the λ-calculus can be made to automatically perform dynamic programming without the need for memoization or recursion constructs.

View →
cs.SEcs.PLTheoreticalRecentSep 23, 2026

Foundations of Algebraic Architecture Theory: A Rising Sea of Geometry, Transport, Comparison, and Reconstruction

Hiroyuki Nakahata

The paper develops Algebraic Architecture Theory (AAT) to determine what changes to AI-generated software preserve and which alternatives remain.

View →
cs.PLTheoreticalRecentJun 19, 2026

Correct and Complete Symbolic Execution for Free

Erik Voogd, Einar Broch Johnsen, Åsmund Aqissiaq Arild Kløvstad, Jurriaan Rot +1 more

This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.

View →
cs.AIcs.PLEmpiricalRecentOct 16, 2026

Where Does the Performance Go? Understanding and Recovering Performance Regressions in C-to-Rust Translation

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.

View →
cs.PLTheoreticalRecentJul 17, 2026

Bidirectional Typing with Freezing, Skeletons, and Ghosts

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.

View →
cs.PLcs.MScs.SEEmpiricalRecentJul 28, 2026

Progress in Benchmarking Generics for Mathematical Computation

Daniel Pang, Stephen M. Watt

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…

View →
cs.PLTheoreticalRecentOct 20, 2026

Record Types Everywhere

Matthew Toohey, Ara Jamalzadeh, Ningning Xie

A novel calculus is introduced that models first-class environments and function application using standard record types.

View →
cs.PLcs.SETheoreticalRecentJul 17, 2026

A Modular Framework for Stack-Heap and Value Abstractions (Extended Version)

Giacomo Boldini, Luca Negrini, Luca Olivieri, Pietro Ferrara

The paper proposes a generic memory framework for advanced static program analysis, supporting various memory behaviors from different programming languages using Abstract Interpretation theory.

View →
cs.PLcs.CCcs.DBRecentJun 1, 2026

From Time to Space: The Impact of Linearity in Higher-Order Datalog

Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis

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…

View →
cs.PLcs.LOTheoreticalRecentJul 20, 2026

The Because-Calculus: Separating Production, Existence, and Interpretation in Computation

Oscar Perez Mora

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.

View →
cs.PLTheoreticalRecentJul 20, 2026

Extended Abstract: From Pattern Unification Towards Pattern Matching Unification

David Richter, Timon Böhler

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…

View →