20 results for “Familiarity with graded types and coeffects”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper provides translations between two graded coeffect systems, enabling the transfer of results and ideas between them.
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…
Harrison Grodin, Ethan Chu, Runming Li, Jan Hoffmann +1 more
This paper presents Calf, a dependent type theory for cost verification, which synthesizes the physicist's and banker's views on amortized analysis using potential functions and credit annotations.
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.
The paper introduces a new term expansion for a calculus with explicit substitutions, allowing the relation of a lambda-calculus with explicit substitutions to Boudol's resource aware lambda-calculus.
This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.
This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.
This paper characterizes proper binary classification from positive-only samples, revealing a rich landscape that differs from standard PAC learning.
KACE introduces a novel knowledge-adaptive context engineering framework that separates knowledge storage from usage, significantly improving mathematical reasoning accuracy on challenging benchmarks…
A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…
The paper quantitatively confirms the Currier A/B language distinction in the Voynich Manuscript, demonstrating it is governed by a higher-dimensional, context-dependent boolean switch rather than a s…
This paper introduces a fuzzy-logic-based qualitative extension of Answer Set Programming (ASP) to integrate numerical information and qualitative reasoning.
This paper introduces Generalized Constraint Projection (GCP), a zero-annotation inference framework for dynamically typed languages, which separates sources of evidence for function parameters and pr…
The paper introduces a new quantitative metric, Contextual Alternative Choice (CAC), to rigorously test language models' syntactic and functional understanding of determiners, showing that current mod…
The paper introduces the Decan metric, a novel, information-theoretic approach for measuring creative diversity in AI outputs, which successfully detects diversity loss across different model fine-tun…
This paper challenges the claim that neural networks have met the challenge of systematicity in language and thought as proposed by Fodor and Pylyshyn, demonstrating limitations in a recent neural net…
The paper challenges the conclusion that LLMs lack reasoning by demonstrating that reported performance drops on GSM-Symbolic are often statistically weak and partially attributable to dataset biases,…