Cited in
(65)- A characterization of F-complete type assignments
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Type reconstruction in finite rank fragments of the second-order -calculus
- Complete restrictions of the intersection type discipline
- Intersection types for combinatory logic
- Types with intersection: An introduction
- Typing untyped \(\lambda\)-terms, or reducibility strikes again!
- \(F\)-semantics for type assignment systems
- Intersection type assignment systems
- The ``relevance of intersection and union types
- Typed generic traversal with term rewriting strategies
- Nominal essential intersection types
- Strong normalization through intersection types and memory
- Typing and computational properties of lambda expressions
- Normalization without reducibility
- Normalization, approximation, and semantics for combinator systems
- Intersection and singleton type assignment characterizing finite Böhm-trees
- Principality and type inference for intersection types using expansion variables
- Strong normalization and typability with intersection types
- Non-idempotent intersection types in logical form
- Intersection types and lambda models
- Reasoning about call-by-need by means of types
- Elaborating intersection and union types
- Disjoint polymorphism
- Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
- A Type Theory for Probabilistic \lambda –calculus
- A filter lambda model and the completeness of type assignment
- Meeting of the Association for Symbolic Logic, Stanford, California, 1985
- Semantic types and approximation for Featherweight Java
- A resource aware semantics for a focused intuitionistic calculus
- Simple type-theoretic foundations for object-oriented programming
- Hyperformulae, parallel deductions and intersection types
- Intersection types and computational rules
- The emptiness problem for intersection types
- Taming the merge operator
- On sets of terms having a given intersection type
- The -calculus: syntax and types
- Sequence types for hereditary permutators
- The -framework
- Intersection and union types
- The coherence of languages with intersection types
- Type Inference for Rank 2 Gradual Intersection Types
- Non-idempotent types for classical calculi in natural deduction style
- Essential and relational models
- Full abstraction for lambda calculus with resources and convergence testing
- Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved
- Strictness, totality, and non-standard-type inference
- Completeness of intersection and union type assignment systems for call-by-value -models
- Completeness of type assignment systems with intersection, union, and type quantifiers
- The bang calculus revisited
- Structural rules and algebraic properties of intersection types
- Applicative intersection types
- Node Replication: Theory And Practice
- Manifest contracts with intersection types
- Characterization of the principal type of normal forms in an intersection type system
- Pregrammars and intersection types
- Semantic bounds and multi types, revisited
- Mechanized subject expansion in uniform intersection types for perpetual reductions
- Meaningfulness and genericity in a subsuming framework (invited talk)
- Recursive subtyping for all
- YACC: Yet Another Church Calculus. A birthday present for Herman inspired by his supervisor activity
- Principal type schemes for an extended type theory
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
- On strong normalization and type inference in the intersection type discipline
- A type assignment system for game semantics
This page was built for publication: Functional Characters of Solvable Terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936713)
