Kamareddine, Fairouz D.
| rdfs:label | "Kamareddine, Fairouz D." |
| schema:name | "Fairouz D. Kamareddine" |
|
schema:family |
"Kamareddine" |
|
schema:given |
"Fairouz D." |
|
schema:same |
<https:/ |
|
<http:/ |
|
|
schema:main |
<https:/ |
Inverse relations
[ .. ] → schema:contributor → Kamareddine, Fairouz D.
A unified approach to type theory through a refined →l⇋-calculus / by Rob Nederpelt, Fairouz Kamareddineschema:ProductModel
A useful lambda notation / by Rob Nederpelt, Fairouz Kamareddineschema:ProductModel
Beyond β-reduction in Church's →l⇋→ / by R. Bloo, F. Kamareddine and R. Nederpeltschema:ProductModel
On stepwise explicit substitution / by R.P. Nederpelt and F. Kamareddineschema:ProductModel
On →π⇋-conversion in type theory / by R. Bloo, F. Kamareddine, R. Nederpeltschema:ProductModel
The Barendregt Cube with definitions and generalised reduction / Roel Bloo and Fairouz Kamareddine and Rob Nederpeltschema:ProductModel
The →l⇋-cube with classes of terms modulo conversion / by R. Bloo, F. Kamareddine and R. Nederpeltschema:ProductModel
Thirty five years of automating mathematics / ed. by Fairouz D. Kamareddineschema:ProductModel
[ .. ] → schema:author → Kamareddine, Fairouz D.
A correspondence between Nuprl and the ramified theory of types / by Fairouz Kamareddine and Twan Laanschema:ProductModel
A modern perspective on type theory : from its origins until today / by Fairouz Kamareddine, Twan Laan and Rob Nederpeltschema:ProductModel
A reflection on Russell's ramified types and Kripke's hierarchy of truths / by F. Kamareddine and T. Laanschema:ProductModel
A semantics for a fine →l⇋-calculus with de Bruijn indices / by F. Kamareddine and R. Nederpeltschema:ProductModel
A system at the croos-roads [i.e. cross-roads] of functional and logic programming / by Fairouz Kamareddineschema:ProductModel
Are types needed for natural language? / by Fairouz Kamareddineschema:ProductModel
Canonical typing and →P⇋-conversion / by F. Kamareddine and R. Nederpeltschema:ProductModel
Canonical typing and →P⇋-conversion in the Barendregt cube / by F. Kamareddine and R. Nederpeltschema:ProductModel
Characterizing →l⇋-terms with equal reduction behavior / by Fairouz Kamareddine and Roel Bloo and Rob Nederpeltschema:ProductModel
Nominalization, predication and type containment / by F. Kamareddine and E. Kleinschema:ProductModel
Non well-foundedness and type freeness can unify the interpretation of functional application / by Fairouz Kamareddineschema:ProductModel
Refining reduction in the lambda calculus / by F. Kamareddine and R. Nederpeltschema:ProductModel
Set theory and nominalisation / by Fairouz Kamareddineschema:ProductModel
Set theory and nominalisation / Fairouz Kamareddineschema:ProductModel
Set theory and nominalisation / Fairouz Kamareddineschema:ProductModel