Corpus ID: 24705351

Formalising Type-Logical Grammars in Agda

@article{Kokke2017FormalisingTG,
  title={Formalising Type-Logical Grammars in Agda},
  author={Wen Kokke},
  journal={ArXiv},
  year={2017},
  volume={abs/1709.00728}
}
  • Wen Kokke
  • Published 2017
  • Mathematics, Computer Science
  • ArXiv
In recent years, the interest in using proof assistants to formalise and reason about mathematics and programming languages has grown. Type-logical grammars, being closely related to type theories and systems used in functional programming, are a perfect candidate to next apply this curiosity to. The advantages of using proof assistants is that they allow one to write formally verified proofs about one's type-logical systems, and that any theory, once implemented, can immediately be computed… Expand
1 Citations
A Survey on Theorem Provers in Formal Methods
  • 3
  • PDF

References

SHOWING 1-10 OF 14 REFERENCES
Dependently Typed Programming in Agda
  • U. Norell
  • Computer Science
  • Advanced Functional Programming
  • 2008
  • 292
  • PDF
Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
  • 33
Une bibliothèque Coq pour le traitement des langues naturelles
  • Houda Anoun
  • Computer Science
  • Tech. Sci. Informatiques
  • 2007
  • 2
Symmetric Categorial Grammar
  • M. Moortgat
  • Mathematics, Computer Science
  • J. Philos. Log.
  • 2009
  • 45
  • Highly Influential
In Situ Binding: A Modal Analysis
  • 26
Continuations and Natural Language
  • 63
  • PDF
Lexical Meaning in Context - A Web of Words
  • 328
  • PDF
The Logic of Categorial Grammars
  • 93
  • PDF
Proof nets for the grammatical base logic
  • Proceedings of the Fourth Roma Workshop,
  • 1999
Language, Information and Computation, pages 264–284
  • Journal of Philosophical Logic,
  • 2009
...
1
2
...