Temporal-logic approach to binding-time analysis

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2016, Pages 184-195

  Davies, Rowan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; THEOREM PROVING; TIME DOMAIN ANALYSIS;

BINDING TIME ANALYSIS; CURRY HOWARD ISOMORPHISM; FUNCTIONAL PROGRAMMING LANGUAGE; LINEAR TIME TEMPORAL LOGIC; TIME ORDERED NORMALIZATION;

FORMAL LOGIC;

EID: 0029719031     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Automatic autoprojection of recursive equations with global variables and abstract types
2. Inheritance as implicit coercion
3. A simple applicative language: Mini-ML
4. Type-directed partial evaluation
5. A modal analysis of staged computation
6. Refinement types for ML
7. Extending the Curry-Howard Interpretation to Linear, Relevant and Other Resource Logics
8. Efficient multi-level generating extensions for program specialization
9. A partial evaluator for the untyped lambda-calculus
10. Mechanically verifying the correctness of an offline partial evaluator
11. The formulae-as-types notion of construction
12. Partial Evaluation ancl Aurotnatic Program Generation
13. computational interpretation of modal proofs
14. Two-level functional languages
15. Correctness of binding time analysis
16. Logic programming in the LF logical framework
17. Modal and temporal logics
18. Very efficient conversions