Pages that link to "Item:Q751294"

The following pages link to The semantics of second-order lambda calculus (Q751294):

Displaying 22 items.

• Monad transformers as monoid transformers (Q615955) (← links)
• Functorial polymorphism (Q753948) (← links)
• A modest model of records, inheritance, and bounded quantification (Q922718) (← links)
• Between constructive mathematics and PROLOG (Q1173742) (← links)
• Recursive types for Fun (Q1176245) (← links)
• Categorical models of polymorphism (Q1193592) (← links)
• Constructing type systems over an operational semantics (Q1199709) (← links)
• \(F\)-semantics for type assignment systems (Q1329739) (← links)
• A domain-theoretic semantics of lax generic functions. (Q1398469) (← links)
• Polymorphic lambda calculus and subtyping. (Q1605176) (← links)
• A full continuous model of polymorphism (Q1853594) (← links)
• Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
• Term-generic logic (Q2339466) (← links)
• CPO-models for second order lambda calculus with recursive types and subtyping (Q3142273) (← links)
• Operations on records (Q3349962) (← links)
• Semantics of the second order lambda calculus (Q4006235) (← links)
• Categorical data types in parametric polymorphism (Q4286531) (← links)
• A paradigmatic object-oriented programming language: Design, static typing and semantics (Q4764618) (← links)
• Parametricity of extensionally collapsed term models of polymorphism and their categorical properties (Q5096235) (← links)
• Singleton, union and intersection types for program extraction (Q5096245) (← links)
• Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
• CATEGORICAL MODEL CONSTRUCTION FOR PROVING SYNTACTIC PROPERTIES (Q5249254) (← links)