The following pages link to Types and programing languages (Q2778806):
Displaying 50 items.
- Type inference and strong static type checking for Promela (Q988201) (← links)
- Amalgamating sessions and methods in object-oriented languages with generics (Q1004058) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Featherweight Java with dynamic and static overloading (Q1016639) (← links)
- Objects and session types (Q1021571) (← links)
- Recasting ML\(^{\text F}\) (Q1023287) (← links)
- Multiparty session types, beyond duality (Q1647963) (← links)
- Composition-nominative logics as institutions (Q1653557) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- Towards proving type safety of \(\mathrm{C}^{\#}\) (Q1749247) (← links)
- A type system for counting instances of software components (Q1758151) (← links)
- Amalgamation in the semantics of CASL (Q1770431) (← links)
- On the complexity of deciding typability in the relational algebra (Q1777227) (← links)
- Encoding types in ML-like languages (Q1826630) (← links)
- Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
- A solution to the PoplMark challenge using de Bruijn indices in Isabelle/HOL (Q1945915) (← links)
- Composition and decomposition of multiparty sessions (Q1996856) (← links)
- Verifying pointer and string analyses with region type systems (Q2014831) (← links)
- Enhanced type inference for binding-time analysis (Q2061291) (← links)
- From specification to testing: semantics engineering for Lua 5.2 (Q2102942) (← links)
- Polymorphic lambda calculus with context-free session types (Q2105433) (← links)
- Session-based concurrency, declaratively (Q2120811) (← links)
- Gradual typing using union typing with records (Q2133461) (← links)
- Nonlinear pattern matching in rule-based modeling languages (Q2142118) (← links)
- A program logic for fresh name generation (Q2145263) (← links)
- Abstraction and subsumption in modular verification of C programs (Q2147702) (← links)
- Functional sets with typed symbols: Mixed zonotopes and polynotopes for hybrid nonlinear reachability and filtering (Q2159000) (← links)
- Region analysis for deductive verification of C programs (Q2216720) (← links)
- Verified software units (Q2233451) (← links)
- On quantified linear implications (Q2254606) (← links)
- Global types with internal delegation (Q2286741) (← links)
- Reversible sessions with flexible choices (Q2329306) (← links)
- QPCF: higher-order languages and quantum circuits (Q2331073) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus (Q2343135) (← links)
- Minimal type inference for linked data consumers (Q2348796) (← links)
- Data-driven adaptation for smart sessions (Q2360650) (← links)
- On the value of variables (Q2401632) (← links)
- Model approach to grammatical evolution: theory and case study (Q2403418) (← links)
- A graph-based generic type system for object-oriented programs (Q2418638) (← links)
- Precise subtyping for synchronous multiparty sessions (Q2423747) (← links)
- A reduction semantics for direct-style asynchronous observables (Q2423763) (← links)
- Typed path polymorphism (Q2424892) (← links)
- Formalising Java RMI with explicit code mobility (Q2463558) (← links)
- Domain-theoretical models of parametric polymorphism (Q2464940) (← links)
- Translating higher-order clauses to first-order clauses (Q2471742) (← links)
- Semantic essence of AsmL (Q2571205) (← links)
- MOMI: a calculus for mobile mixins (Q2576664) (← links)
- Subtyping for session types in the pi calculus (Q2576666) (← links)
