Similar Items: On completeness and parametricity in the realizability semantics of System F
- A revised completeness result for the simply typed $lambdamu$-calculus using realizability semantics
- Semantics and Algorithms for Parametric Monitoring
- Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
- A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice
- On completeness of reducibility candidates as a semantics of strong normalization
- Parametric updates in parametric timed automata