The following pages link to Fairouz Kamareddine (Q195251):
Displaying 50 items.
- Bridging Curry and Church's typing style (Q334149) (← links)
- Skalpel: a constraint-based type error slicer for standard ML (Q507365) (← links)
- A completeness result for a realisability semantics for an intersection type system (Q882122) (← links)
- A system at the cross-roads of functional and logic programming (Q1208425) (← links)
- On \(\Pi\)-conversion in the \(\lambda\)-cube and the combination with abbreviations (Q1302298) (← links)
- Nominalization, predication and type containment (Q1314276) (← links)
- \(\lambda\)-terms, logic, determiners and quantifiers (Q1314293) (← links)
- A unified approach to type theory through a refined \(\lambda\)-calculus (Q1349674) (← links)
- A useful \(\lambda\)-notation (Q1365680) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case (Q1763159) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case (Q1764799) (← links)
- Comparing and implementing calculi of explicit substitutions with eta-reduction (Q1779307) (← links)
- Formalizing strong normalization proofs of explicit substitution calculi in ALF (Q1810858) (← links)
- A refinement of de Bruijn's formal language of mathematics (Q1876109) (← links)
- A modern perspective on type theory. From its origins until today (Q1887432) (← links)
- A type free theory and collective/distributive predication (Q1903083) (← links)
- The Barendregt cube with definitions and generalised reduction (Q1917101) (← links)
- Generating custom set theories with non-set structured objects (Q2128829) (← links)
- Adding an abstraction barrier to ZF set theory (Q2219382) (← links)
- BNF-style notation as it is actually used (Q2287909) (← links)
- Higher-order unification: a structural relation between Huet's method and the one based on explicit substitutions (Q2480966) (← links)
- Unification via the \(\lambda s_e\)-style of explicit substitutions (Q2743636) (← links)
- Reviewing the classical and the de Bruijn notation for \(\lambda\)-calculus and pure type systems (Q2752527) (← links)
- (Q2763649) (← links)
- MathLang: experience-driven development of a new mathematical language (Q2847398) (← links)
- Computerizing mathematical text with MathLang (Q2866734) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- (Q3044340) (← links)
- On Functions and Types: A Tutorial (Q3085978) (← links)
- (Q3086726) (← links)
- Russell's Orders in Kripke's Theory of Truth and Computational Type Theory (Q3166620) (← links)
- Automath Type Inclusion in Barendregt’s Cube (Q3194722) (← links)
- (Q3376918) (← links)
- Principal Typings for Explicit Substitutions Calculi (Q3507473) (← links)
- MathLang Translation to Isabelle Syntax (Q3637293) (← links)
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★ (Q3647258) (← links)
- Explicit substitutions calculi with one step Eta-reduction decided explicitly (Q3653146) (← links)
- Bridging de Bruijn indices and variable names in explicit substitutions calculi (Q4222186) (← links)
- (Q4259970) (← links)
- ON STEPWISE EXPLICIT SUBSTITUTION (Q4286110) (← links)
- Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms (Q4360125) (← links)
- (Q4364376) (← links)
- (Q4447225) (← links)
- (Q4494365) (← links)
- Relating the - and s-styles of explicit substitutions (Q4500175) (← links)
- (Q4501582) (← links)
- Postponement, conservation and preservation of strong normalization for generalized reduction (Q4522334) (← links)
- Pure Type Systems with de Bruijn Indices (Q4542807) (← links)
- Explicit substitution calculi with de Bruijn indices and intersection type systems (Q4644515) (← links)
