Strongly Typed Term Representations in Coq-Reference-Cited by-同舟云学术

Strongly Typed Term Representations in Coq

Published:2011-03-02 Issue:2 Volume:49 Page:141-159
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Benton Nick,Hur Chung-Kil,Kennedy Andrew J.,McBride Conor

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10817-011-9219-0.pdf

Reference27 articles.

1. Adams, R.: Formalized metatheory with terms represented by an indexed family of types. In: Types for Proofs and Programs. Lecture Notes in Computer Science, vol. 3839, pp. 1–16. Springer (2006)

2. Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Computer Science Logic, 13th International Workshop (CSL’99). Lecture Notes in Computer Science, vol. 1683, pp. 453–468. Springer (1999)

3. Benton, N., Hur, C.K.: Biorthogonality, step-indexing and compiler correctness. In: Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming (ICFP’09), pp. 97–108. ACM (2009)

4. Benton, N., Hur, C.K.: Realizability and compositional compiler correctness for a polymorphic language. Tech. Rep. MSR-TR-2010-62, Microsoft Research (2010)

5. Benton, N., Kennedy, A.J., Varming, C.: Some domain theory and denotational semantics in Coq. In: Theorem Proving in Higher Order Logics, 22nd International Conference (TPHOLs’09). Lecture Notes in Computer Science, vol. 5674, pp. 115–130. Springer (2009)

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Metalanguage for Cost-Aware Denotational Semantics;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Experimenting with an Intrinsically-Typed Probabilistic Programming Language in Coq;Programming Languages and Systems;2023

3. Semantic analysis of normalisation by evaluation for typed lambda calculus;Mathematical Structures in Computer Science;2022-09

4. Verified symbolic execution with Kripke specification monads (and no meta-programming);Proceedings of the ACM on Programming Languages;2022-08-29

5. An intrinsically-typed solution for the list-machine benchmark;Journal of Computer Languages;2022-02