The following pages link to Benjamin C. Pierce (Q879362):
Displayed 50 items.
- Exploiting schemas in data synchronization (Q882445) (← links)
- Item:Q879362 (redirect page) (← links)
- Bounded existentials and minimal typing (Q1127527) (← links)
- Bounded quantification is undecidable (Q1327694) (← links)
- Higher-order subtyping (Q1392282) (← links)
- Comparing object encodings. (Q1854318) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Type destructors (Q1854494) (← links)
- Foundations for virtual types (Q1854531) (← links)
- On inner classes (Q1854553) (← links)
- Positive subtyping (Q1917089) (← links)
- The meaning of memory safety (Q2324196) (← links)
- (Q2778806) (← links)
- Linear dependent types for differential privacy (Q2931812) (← links)
- Edit lenses (Q2942897) (← links)
- Regular expression types for XML (Q2943355) (← links)
- Recursive subtyping revealed (Q2943374) (← links)
- Foundational Property-Based Testing (Q2945645) (← links)
- Polymorphic Contracts (Q3000571) (← links)
- Regular expression pattern matching for XML (Q3160299) (← links)
- Engineering formal metatheory (Q3189820) (← links)
- Boomerang (Q3189860) (← links)
- (Q3204052) (← links)
- Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data (Q3524310) (← links)
- A bisimulation for type abstraction and recursion (Q3546343) (← links)
- (Q3837262) (← links)
- (Q3837264) (← links)
- FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES (Q3988831) (← links)
- (Q4023244) (← links)
- (Q4281484) (← links)
- Intersection types and bounded polymorphism (Q4340497) (← links)
- TinkerType: a language for playing with formal systems (Q4457834) (← links)
- (Q4473165) (← links)
- Recursive subtyping revealed (Q4709841) (← links)
- Simple type-theoretic foundations for object-oriented programming (Q4764619) (← links)
- Dynamic typing in polymorphic languages (Q4836024) (← links)
- (Q4855344) (← links)
- (Q4937118) (← links)
- Distance makes the types grow stronger (Q5176936) (← links)
- Matching lenses (Q5176940) (← links)
- Quotient lenses (Q5178774) (← links)
- Regular expression pattern matching for XML (Q5178874) (← links)
- Contracts made manifest (Q5255093) (← links)
- A bisimulation for type abstraction and recursion (Q5276135) (← links)
- Combinators for bi-directional tree transformations (Q5276149) (← links)
- Contracts made manifest (Q5398336) (← links)
- A verified information-flow architecture (Q5408414) (← links)
- Symmetric lenses (Q5408557) (← links)
- A Formal Investigation of Diff3 (Q5458859) (← links)
- Theorem Proving in Higher Order Logics (Q5477646) (← links)
