The following pages link to (Q3478384):
Displaying 17 items.
- Explicit mathematics: power types and overloading (Q556826) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- A theory for program and data type specification (Q1199933) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- A first order logic of effects (Q1390955) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Polymorphic lambda calculus and subtyping. (Q1605176) (← links)
- Polymorphic lambda calculus with context-free session types (Q2105433) (← links)
- Herbrand analyses (Q2641297) (← links)
- (Q2766797) (← links)
- A Polymorphic Type System for the Lambda-Calculus with Constructors (Q3637198) (← links)
- (Q4263869) (← links)
- A calculus with polymorphic and polyvariant flow types (Q4542147) (← links)
- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism (Q4928456) (← links)
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi (Q5020907) (← links)
- Programming Languages and Systems (Q5316578) (← links)
- (Q5376659) (← links)