Pages that link to "Item:Q801050"

The following pages link to The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050):

Displaying 50 items.

• Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
• A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
• Towards a notion of lambda monoid (Q280190) (← links)
• Relational graph models, Taylor expansion and extensionality (Q283769) (← links)
• Graph easy sets of mute lambda terms (Q288793) (← links)
• Gödelization in the lambda calculus (Q294781) (← links)
• The expectation monad in quantum foundations (Q320204) (← links)
• Bridging Curry and Church's typing style (Q334149) (← links)
• A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
• Boolean-like algebras (Q353355) (← links)
• A decidable theory of type assignment (Q365669) (← links)
• Monoidal computer. I: Basic computability by string diagrams (Q385721) (← links)
• Semantic types and approximation for Featherweight Java (Q387991) (← links)
• A relational semantics for parallelism and non-determinism in a functional setting (Q408545) (← links)
• Alpha equivalence equalities (Q428860) (← links)
• Internal models of system F for decompilation (Q428882) (← links)
• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
• A Church-style intermediate language for ML\(^{\text F}\) (Q428892) (← links)
• Categorical pairs and the indicative shift (Q440655) (← links)
• A note on harmony (Q452347) (← links)
• A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
• Quantum computation: from a programmer's perspective (Q468591) (← links)
• The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. (Q505454) (← links)
• On equal \(\mu \)-terms (Q549186) (← links)
• Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
• Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) (← links)
• Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
• Continuous monoids and semirings (Q596031) (← links)
• Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
• Synthesizable high level hardware descriptions (Q609757) (← links)
• Setting the facts straight (Q626491) (← links)
• Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
• Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
• Comparing models of the intensional typed \(\lambda\)-calculus (Q671646) (← links)
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
• Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
• Principles of programming with complex objects and collection types (Q672333) (← links)
• Properties of a first-order functional language with sharing (Q673126) (← links)
• On abstract normalisation beyond neededness (Q683744) (← links)
• Computational interpretations of linear logic (Q685430) (← links)
• Spaces with combinators (Q688513) (← links)
• Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
• Forcing in stable models of untyped \(\lambda\)-calculus (Q698623) (← links)
• Simulations in coalgebra (Q703522) (← links)
• The stream-based service-centred calculus: a foundation for service-oriented programming (Q736830) (← links)
• N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
• De Bruijn's weak diamond property revisited (Q740482) (← links)
• Viewing \({\lambda}\)-terms through maps (Q740485) (← links)
• The semantics of second-order lambda calculus (Q751294) (← links)
• Type inference with recursive types: Syntax and semantics (Q756435) (← links)