The following pages link to PoplMark (Q22078):
Displayed 16 items.
- Mechanizing proofs with logical relations – Kripke-style (Q4691187) (← links)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus (Q4972064) (← links)
- Formalizing Operational Semantic Specifications in Logic (Q4982629) (← links)
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi (Q5020907) (← links)
- Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention (Q5022932) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- (Q5111317) (← links)
- Structural Abstract Interpretation: A Formal Study Using Coq (Q5191090) (← links)
- The Matita Interactive Theorem Prover (Q5200015) (← links)
- Free Theorems and Runtime Type Representations (Q5262947) (← links)
- Mechanizing metatheory in a logical framework (Q5308093) (← links)
- Type Preservation as a Confluence Problem (Q5389092) (← links)
- Multimodal Separation Logic for Reasoning About Operational Semantics (Q5415628) (← links)
- A Sound Semantics for OCaml light (Q5458382) (← links)
- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison (Q5747652) (← links)
- Psi-calculi in Isabelle (Q5890661) (← links)