Pages that link to "Item:Q1250704"
From MaRDI portal
The following pages link to A theory of type polymorphism in programming (Q1250704):
Displaying 50 items.
- ML (Q13958) (← links)
- Contract-based verification of MATLAB-style matrix programs (Q282101) (← links)
- Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation (Q287361) (← links)
- Formalization of reliability block diagrams in higher-order logic (Q334147) (← links)
- Effect-polymorphic behaviour inference for deadlock checking (Q338624) (← links)
- Programming with algebraic effects and handlers (Q478396) (← links)
- The complexity of higher-order queries (Q498405) (← links)
- An approach to completing variable names for implicitly typed functional languages (Q526448) (← links)
- Structural types for systems of equations: type refinements for structurally dynamic first-class modular systems of equations (Q526451) (← links)
- A language for generic programming in the large (Q532409) (← links)
- Reasoning about conditional probabilities in a higher-order-logic theorem prover (Q545151) (← links)
- Formal reliability analysis of combinational circuits using theorem proving (Q545153) (← links)
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
- Reusing and modifying rulebases by predicate substitution (Q676430) (← links)
- Region-based memory management (Q676777) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions (Q764331) (← links)
- Formal reliability and failure analysis of Ethernet based communication networks in a smart grid substation (Q782499) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- A polymorphic type system for Prolog (Q796313) (← links)
- Type inference for record concatenation and multiple inheritance (Q808687) (← links)
- High-level modelling for typed functional programming (Q832100) (← links)
- Efficient virtual machine support of runtime structural reflection (Q838165) (← links)
- Polymorphic typed defunctionalization and concretization (Q853737) (← links)
- Type checking a multithreaded functional language with session types (Q859841) (← links)
- A proof-centric approach to mathematical assistants (Q865648) (← links)
- Verification of FPGA layout generators in higher-order logic (Q877830) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Meta-circular interpreter for a strongly typed language (Q908683) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- Constructive system for automatic program synthesis (Q912589) (← links)
- Deforestation: Transforming programs to eliminate trees (Q914358) (← links)
- Semantics of types for database objects (Q915443) (← links)
- Type inference for polymorphic references (Q918190) (← links)
- The calculus of context relations (Q918720) (← links)
- Towards proving type safety of .NET CIL (Q941469) (← links)
- Type inference and strong static type checking for Promela (Q988201) (← links)
- Formalization of the standard uniform random variable (Q995466) (← links)
- Recasting ML\(^{\text F}\) (Q1023287) (← links)
- Using theorem proving to verify expectation and variance for discrete random variables (Q1040780) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Inserting injection operations to denotational specifications (Q1082803) (← links)
- On the existence of free models in abstract algebraic institutions (Q1085969) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Toward formal development of programs from algebraic specifications: Implementations revisited (Q1090100) (← links)
- Quasi-varieties in abstract algebraic institutions (Q1091132) (← links)
