Dependently-Typed Montague Semantics in the Proof Assistant Agda-flat
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Structure-Aware Representations of Dependent Types
Agda is a dependently-typed programming language and a proof assistant, pivotal in proof formalization and programming language theory. This paper extends the Agda ecosystem into machine learning territory, and, vice ver…
The Algebra of Meaning: Why Machines Need Montague More Than Moore's Law
Contemporary language models are fluent yet routinely mis-handle the types of meaning their outputs entail. We argue that hallucination, brittle moderation, and opaque compliance outcomes are symptoms of missing type-the…
Legal ReasoningTheorem Proving in Dependently-Typed Higher-Order Logic -- Extended Preprint
Higher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures. But its type system lacks advanced features where types may depend on terms. Dependent type the…
Automated Theorem ProvingTranslationDependently Typed Knowledge Graphs
Reasoning over knowledge graphs is traditionally built upon a hierarchy of languages in the Semantic Web Stack. Starting from the Resource Description Framework (RDF) for knowledge graphs, more advanced constructs have b…
Knowledge GraphsWhen Agda met Vampire
Dependently-typed proof assistants furnish expressive foundations for mechanised mathematics and verified software. However, automation for these systems has been either modest in scope or complex in implementation. We a…