Pages that link to "Item:Q4939697"
From MaRDI portal
The following pages link to Introduction to generalized type systems (Q4939697):
Displayed 35 items.
- A typed \(\lambda\)-calculus for proving-by-example and bottom-up generalization procedure (Q674399) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- The undecidability of pattern matching in calculi where primitive recursive functions are representable (Q1208421) (← links)
- A syntactic proof of the conservativity of \(\lambda_\omega\) over \(\lambda_2\) (Q1288430) (← links)
- Comparing cubes of typed and type assignment systems (Q1365249) (← links)
- The expansion postponement in pure type systems (Q1375333) (← links)
- The calculus of constructions as a framework for proof search with set variable instantiation (Q1575927) (← links)
- A semantic framework for proof evidence (Q1701039) (← links)
- Proof certificates for equality reasoning (Q1744408) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- Strong normalization in type systems: A model theoretical approach (Q1891251) (← links)
- A note on the proof theory of the \(\lambda \Pi\)-calculus (Q1891931) (← links)
- Type-specialized staged programming with process separation (Q1929349) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Higher-order pattern anti-unification in linear time (Q2362208) (← links)
- Classical \(F_{\omega}\), orthogonality and symmetric candidates (Q2482840) (← links)
- Executable Relational Specifications of Polymorphic Type Systems Using Prolog (Q2798266) (← links)
- Comprehensive Parametric Polymorphism: Categorical Models and Type Theory (Q2811329) (← links)
- Unified Syntax with Iso-types (Q3179296) (← links)
- A Rewriting Logic Approach to Type Inference (Q3184729) (← links)
- Term-Generic Logic (Q3184738) (← links)
- LeoPARD — A Generic Platform for the Implementation of Higher-Order Reasoners (Q3453128) (← links)
- (Q4222932) (← links)
- Modularity of termination and confluence in combinations of rewrite systems with λω (Q4630300) (← links)
- The variable containment problem (Q4645807) (← links)
- An algorithm for checking incomplete proof objects in type theory with localization and unification (Q4647580) (← links)
- (Q5091142) (← links)
- Singleton, union and intersection types for program extraction (Q5096245) (← links)
- (Q5111317) (← links)
- Representing proof transformations for program optimization (Q5210798) (← links)
- An induction principle for pure type systems (Q5958776) (← links)
- (Q6079236) (← links)
- Checking algorithms for Pure Type Systems (Q6083689) (← links)
- Closure under alpha-conversion (Q6083699) (← links)
- An intuitionistic set-theoretical model of fully dependent CC (Q6174091) (← links)