Dependency grammars as Haskell programs
Code (0)
등록된 구현이 없습니다.
Tasks
Language ModelingLanguage ModellingSimilar Papers 제목 키워드 기반
Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification
We introduce a self-play framework for semantic equivalence in Haskell, utilizing formal verification to guide adversarial training between a generator and an evaluator. The framework leverages Liquid Haskell proofs for …
Reversible Jump Probabilistic Programming
In this paper we present a method for automatically deriving a Reversible Jump Markov chain Monte Carlo sampler from probabilistic programs that specify the target and proposal distributions. The main challenge in automa…
Bayesian InferenceCode GenerationProbabilistic ProgrammingHOTGP -- Higher-Order Typed Genetic Programming
Program synthesis is the process of generating a computer program following a set of specifications, which can be a high-level description of the problem and/or a set of input-output examples. The synthesis can be modele…
Program SynthesisvalidGFLean: An Autoformalisation Framework for Lean via GF
We present an autoformalisation framework for the Lean theorem prover, called GFLean. GFLean uses a high-level grammar writing tool called Grammatical Framework (GF) for parsing and linearisation. GFLean is implemented i…
TranslationIterated Dependencies in a Breton treebank and implications for a Categorial Dependency Grammar
Categorial Dependency Grammars (CDG) are computational grammars for natural language processing, defining dependency structures. They can be viewed as a formal system, where types are attached to words, combining the cla…