Telescopic mappings in typed lambda calculus
Information and Computation
Enriching the lambda calculus with contexts: toward a theory of incremental program construction
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Theory and Practice of Object Systems - Third workshop on foundations of object-oriented languages (FOOL 3)
A Calculus of Lambda Calculus Contexts
Journal of Automated Reasoning
Algorithms and Proofs Inheritance in the FOC Language
Journal of Automated Reasoning
Higher-Order and Symbolic Computation
Mixin Modules in a Call-by-Value Setting
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
A Simply Typed Context Calculus with First-Class Environments
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Dependently Typed Records for Representing Mathematical Structure
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Integrating Computer Algebra and Reasoning through the Type System of Aldor
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Dependent Intersection: A New Way of Defining Records in Type Theory
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A logical framework with dependently typed records
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Development Life-cycle of Critical Software Under FoCaL
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for encoding Focal constructions in the Coq proof assistant. The first one is implemented in the Focal compiler to have the correctness of Focal libraries verified with the Coq proof-checker. The second one formalizes the Focal structures and their main properties as Coq terms (called mixDrecs). The relations between the two embeddings are examined in the last part of the paper.