default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFairouz Kamareddine
Person information
- affiliation: Heriot-Watt University, Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j98]Fairouz Kamareddine
:
Thematic Editorial, It Is Hard To Imagine A World Without Algorithms and Data Science. Comput. J. 67(5): 1605-1606 (2024)- [c43]Luka Vrecar, Joe B. Wells, Fairouz Kamareddine:
Towards Semantic Markup of Mathematical Documents via User Interaction. CICM 2024: 223-240 - [c42]Fairouz Kamareddine, Joe B. Wells:
Intersection Types via Finite-Set Declarations. WoLLIC 2024: 80-92 - [i7]Fairouz Kamareddine:
Substitution in the lambda Calculus and the role of the Curry School. CoRR abs/2401.02745 (2024) - [i6]Fairouz Kamareddine, Jonathan P. Seldin:
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today. CoRR abs/2401.02806 (2024) - [i5]Fairouz Kamareddine, Joe B. Wells:
Intersection Types via Finite-Set Declarations. CoRR abs/2405.00440 (2024) - [i4]Luka Vrecar, Joe B. Wells, Fairouz Kamareddine:
Towards Semantic Markup of Mathematical Documents via User Interaction. CoRR abs/2408.04656 (2024) - 2023
- [c41]Fairouz Kamareddine, Jonathan P. Seldin:
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today. SYNASC 2023: 11-19 - 2021
- [c40]Hua Zhao, Fairouz Kamareddine, Alasdair J. G. Gray, Hind Zantout:
A Novel Method That Identifies The Hidden Properties Of A Person's Name In Kanji Or Hanzi. MISNC 2021: 79-85 - [c39]Ciarán Dunne, J. B. Wells, Fairouz Kamareddine:
Generating Custom Set Theories with Non-set Structured Objects. CICM 2021: 228-244 - [e6]Fairouz Kamareddine, Claudio Sacerdoti Coen:
Intelligent Computer Mathematics - 14th International Conference, CICM 2021, Timisoara, Romania, July 26-31, 2021, Proceedings. Lecture Notes in Computer Science 12833, Springer 2021, ISBN 978-3-030-81096-2 [contents] - 2020
- [c38]Ciarán Dunne, J. B. Wells, Fairouz Kamareddine:
Adding an Abstraction Barrier to ZF Set Theory. CICM 2020: 89-104 - [i3]Ciarán Dunne, J. B. Wells, Fairouz Kamareddine:
Adding an Abstraction Barrier to ZF Set Theory. CoRR abs/2005.13954 (2020)
2010 – 2019
- 2019
- [j97]Imran Sarwar Bajwa, Fairouz Kamareddine, Pamini Thangarajah:
Intelligent Computing for Society. J. Univers. Comput. Sci. 25(10): 1219-1220 (2019) - [c37]Dee Quinlan, Joe B. Wells, Fairouz Kamareddine:
BNF-Style Notation as It Is Actually Used. CICM 2019: 187-204 - [c36]Hua Zhao, Fairouz Kamareddine:
A Novel Phonetic Algorithm for Predicting Chinese Names using Chinese Pin Yin. MLDM (1) 2019: 78-92 - [e5]Imran Sarwar Bajwa, Fairouz Kamareddine, Anna H. R. Costa:
Intelligent Technologies and Applications - First International Conference, INTAP 2018, Bahawalpur, Pakistan, October 23-25, 2018, Revised Selected Papers. Communications in Computer and Information Science 932, Springer 2019, ISBN 978-981-13-6051-0 [contents] - [i2]Hua Zhao, Fairouz Kamareddine:
Advance gender prediction tool of first names and its use in analysing gender disparity in Computer Science in the UK, Malaysia and China. CoRR abs/1906.05769 (2019) - 2018
- [i1]David Feller, Joe B. Wells, Fairouz Kamareddine, Sébastien Carlier:
What Does This Notation Mean Anyway? CoRR abs/1806.08771 (2018) - 2017
- [j96]Vincent Rahli, Joe B. Wells, John Pirie, Fairouz Kamareddine:
Skalpel: A constraint-based type error slicer for Standard ML. J. Symb. Comput. 80: 164-208 (2017) - 2016
- [j95]Fairouz Kamareddine, Jonathan P. Seldin, J. B. Wells:
Bridging Curry and Church's typing style. J. Appl. Log. 18: 42-70 (2016) - 2015
- [j94]Daniel Lima Ventura, Fairouz Kamareddine, Mauricio Ayala-Rincón:
Explicit substitution calculi with de Bruijn indices and intersection type systems. Log. J. IGPL 23(2): 295-340 (2015) - [c35]Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura:
Automath Type Inclusion in Barendregt's Cube. CSR 2015: 262-282 - 2014
- [c34]Vincent Rahli, Joe B. Wells, John Pirie, Fairouz Kamareddine:
Skalpel: A Type Error Slicer for Standard ML. LSFA 2014: 197-213 - [r3]Fairouz Kamareddine, Joe B. Wells, Christoph Zengler, Henk Barendregt:
Computerising Mathematical Text. Computational Logic 2014: 343-396 - 2013
- [j93]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 56(1): 1 (2013) - [e4]Adel Bouhoula, Tetsuo Ida, Fairouz Kamareddine:
Proceedings Fourth International Symposium on Symbolic Computation in Software Science, SCSS 2012, Gammarth, Tunisia, 15-17 December 2012. EPTCS 122, 2013 [contents] - 2012
- [j92]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(1): 1-2 (2012) - [j91]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(2): 133-135 (2012) - [j90]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(3): 253-255 (2012) - [j89]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(4): 379-381 (2012) - [j88]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(5): 509-511 (2012) - [j87]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(6): 649-650 (2012) - [j86]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(7): 777-778 (2012) - [j85]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(9): 1021-1022 (2012) - [j84]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(10): 1147 (2012) - [j83]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(11): 1267-1269 (2012) - [j82]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 55(12): 1419 (2012) - [j81]Fairouz Kamareddine, Vincent Rahli, J. B. Wells:
Reducibility Proofs in the λ-Calculus. Fundam. Informaticae 121(1-4): 121-152 (2012) - [j80]Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells:
On Realisability Semantics for Intersection Types with Expansion Variables. Fundam. Informaticae 121(1-4): 153-184 (2012) - [r2]Fairouz Kamareddine, Twan Laan, Rob Nederpelt:
A History of Types*. Logic: A History of its Central Concepts 2012: 451-511 - [r1]Fairouz Kamareddine, Twan Laan, Robert L. Constable:
Russell's Orders in Kripke's Theory of Truth and Computational Type Theory. Sets and Extensions in the Twentieth Century 2012: 801-845 - 2011
- [j79]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(2): 185-186 (2011) - [j78]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(4): 503-504 (2011) - [j77]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(5): 639-640 (2011) - [j76]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(6): 833-835 (2011) - [j75]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(7): 1005-1009 (2011) - [j74]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(8): 1233-1234 (2011) - [j73]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(9): 1413-1415 (2011) - [j72]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(10): 1561-1564 (2011) - [j71]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(11): 1737-1740 (2011) - [j70]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 54(12): 1925-1927 (2011) - [j69]Mauricio Ayala-Rincón, Elaine Pimentel, Fairouz Kamareddine:
Preface. Theor. Comput. Sci. 412(37): 4851-4852 (2011) - 2010
- [j68]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 53(6): 619-622 (2010) - [c33]Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Intersection Type Systems and Explicit Substitutions Calculi. WoLLIC 2010: 232-246 - [c32]Flávio L. C. de Moura, A. V. Barbosa, Mauricio Ayala-Rincón, Fairouz Kamareddine:
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi. LSFA 2010: 41-54
2000 – 2009
- 2009
- [j67]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 52(2): 169-170 (2009) - [j66]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 52(3): 277-279 (2009) - [j65]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 52(4): 393-394 (2009) - [j64]Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Explicit substitutions calculi with one step Eta-reduction decided explicitly. Log. J. IGPL 17(6): 697-718 (2009) - [c31]Robert Lamar, Fairouz Kamareddine, J. B. Wells:
MathLang Translation to Isabelle Syntax. Calculemus/MKM 2009: 373-388 - [c30]Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices. WRS 2009: 69-82 - [c29]Mauricio Ayala-Rincón, Fairouz Kamareddine:
Preface. LSFA 2009: 1-3 - [e3]Mauricio Ayala-Rincón, Fairouz Kamareddine:
Proceedings of the Fourth Workshop on Logical and Semantic Frameworks, with Applications, LSFA 2009, Brasília, Brazil, August 28, 2009. Electronic Notes in Theoretical Computer Science 256, Elsevier 2009 [contents] - 2008
- [j63]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 51(2): 141-143 (2008) - [j62]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 51(4): 405-407 (2008) - [j61]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 51(6): 609-611 (2008) - [j60]Flávio L. C. de Moura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Higher-Order Unification: A structural relation between Huet's method and the one based on explicit substitutions. J. Appl. Log. 6(1): 72-108 (2008) - [c28]Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Principal Typings for Explicit Substitutions Calculi. CiE 2008: 567-578 - [c27]Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells:
A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. ICTAC 2008: 171-185 - [c26]Fairouz Kamareddine, Vincent Rahli:
Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction. LSFA 2008: 85-101 - 2007
- [j59]Fairouz Kamareddine, Karim Nour:
A completeness result for a realisability semantics for an intersection type system. Ann. Pure Appl. Log. 146(2-3): 180-198 (2007) - [j58]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 50(1): 1-3 (2007) - [j57]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 50(2): 131-133 (2007) - [j56]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 50(3): 251-253 (2007) - [j55]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 50(4): 373-374 (2007) - [j54]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 50(5): 501-504 (2007) - [j53]Fairouz Kamareddine:
Capsule reviews. Comput. J. 50(6): 629 (2007) - [j52]Ariel Arbiser, Fairouz Kamareddine, Alejandro Ríos:
The Weak Normalization of the Simply Typed lambda-se-calculus. Log. J. IGPL 15(2): 121-147 (2007) - [c25]Fairouz Kamareddine, Robert Lamar, Manuel Maarek, J. B. Wells:
Restoring Natural Language as a Computerised Mathematics Input Method. Calculemus/MKM 2007: 280-295 - [c24]Fairouz Kamareddine, Manuel Maarek, Krzysztof Retel, J. B. Wells:
Narrative Structure of Mathematical Texts. Calculemus/MKM 2007: 296-312 - [c23]Fairouz Kamareddine:
The Gradual Computerisation of Mathematics in MathLang. SYNASC 2007: 3 - [c22]Fairouz Kamareddine, J. B. Wells:
Computerizing Mathematical Text with MathLang. LSFA 2007: 5-30 - 2006
- [j51]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 49(1): 1-3 (2006) - [j50]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 49(3): 255-257 (2006) - [j49]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 49(4): 381-382 (2006) - [j48]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 49(5): 505-506 (2006) - [j47]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 49(6): 631-633 (2006) - [j46]Flávio L. C. de Moura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi. J. Appl. Non Class. Logics 16(1-2): 119-150 (2006) - 2005
- [j45]Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine:
Comparing and implementing calculi of explicit substitutions with eta-reduction. Ann. Pure Appl. Log. 134(1): 5-41 (2005) - [j44]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 48(3): 257-258 (2005) - [j43]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 48(4): 382-384 (2005) - [j42]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 48(5): 501 (2005) - [j41]Fairouz Kamareddine:
Capsule Reviews. Comput. J. 48(6): 627-629 (2005) - [j40]Fairouz Kamareddine:
Typed lambda-calculi with one binder. J. Funct. Program. 15(5): 771-796 (2005) - [j39]Fairouz Kamareddine, Roel Bloo:
De Bruijn's syntax and reductional behaviour of lambda-terms: the untyped case. J. Log. Algebraic Methods Program. 62(1): 109-131 (2005) - [j38]Fairouz Kamareddine, Roel Bloo:
De Bruijn's syntax and reductional behaviour of lambda-terms: the typed case. J. Log. Algebraic Methods Program. 62(2): 159-189 (2005) - [c21]Fairouz Kamareddine, Manuel Maarek, J. B. Wells:
Toward an Object-Oriented Structure for Mathematical Text. MKM 2005: 217-233 - 2004
- [j37]Fairouz Kamareddine:
Editorial. J. Appl. Log. 2(2): 169-172 (2004) - [j36]Fairouz Kamareddine, Rob Nederpelt:
A Refinement of de Bruijn's Formal Language of Mathematics. J. Log. Lang. Inf. 13(3): 287-340 (2004) - [c20]Flávio L. C. de Moura, Fairouz Kamareddine, Mauricio Ayala-Rincón:
Second-Order Matching via Explicit Substitutions. LPAR 2004: 433-448 - [c19]Fairouz Kamareddine, Manuel Maarek, J. B. Wells:
Flexible Encoding of Mathematics on the Computer. MKM 2004: 160-174 - [e2]Fairouz Kamareddine:
Proceedings of the Mathematical Knowledge Management Symposium, MKM Symposium 2003, Edinburgh, UK, November 25-29, 2003. Electronic Notes in Theoretical Computer Science 93, Elsevier 2004 [contents] - 2003
- [j35]Fairouz Kamareddine, Qiao Haiyan:
Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF. J. Autom. Reason. 30(1): 59-98 (2003) - [j34]Fairouz Kamareddine, Twan Laan, Rob Nederpelt:
Revisiting the notion of function. J. Log. Algebraic Methods Program. 54(1-2): 65-107 (2003) - [j33]Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón:
On Automating the Extraction of Programs from Termination Proofs. Rev. Colomb. de Computación 4(2) (2003) - [c18]J. B. Wells, Detlef Plump, Fairouz Kamareddine:
Diagrams for Meaning Preservation. RTA 2003: 88-106 - [c17]Fairouz Kamareddine:
Mathematical Knowledge Management Symposium 2003. MKM Symposium 2003: 1-4 - [c16]Fairouz Kamareddine, Twan Laan, Rob Nederpelt:
Automath and Pure Type Systems. Mathematics, Logic and Computation @ ICALP 2003: 30-49 - [c15]Fairouz Kamareddine, Alejandro Ríos:
Explicit substitutions à la de Bruijn: the local and global way. Mathematics, Logic and Computation @ ICALP 2003: 86-105 - [c14]Fairouz Kamareddine, Manuel Maarek, J. B. Wells:
MathLang: Experience-driven Development of a New Mathematical Language. MKM Symposium 2003: 138-160 - [c13]Herman Geuvers, Fairouz Kamareddine:
Preface. Mathematics, Logic and Computation @ ICALP 2003: 146-147 - [e1]Herman Geuvers, Fairouz Kamareddine:
Mathematics, Logic and Computation, Satellite Event of ICALP 2003, Eindhoven, The Netherlands, July 4-5, 2003. Electronic Notes in Theoretical Computer Science 85(7), Elsevier 2003 [contents] - 2002
- [j32]Fairouz Kamareddine, Twan Laan, Rob Nederpelt:
Types in logic and mathematics before 1940. Bull. Symb. Log. 8(2): 185-245 (2002) - [j31]Fairouz Kamareddine, Alejandro Ríos:
Pure Type Systems with de Bruijn Indices. Comput. J. 45(2): 187-201 (2002) - [j30]Tijn Borghuis, Fairouz Kamareddine, Rob Nederpelt:
Formalizing Belief Revision in Type Theory. Log. J. IGPL 10(5): 461-500 (2002) - [j29]Fairouz Kamareddine, François Monin:
An Extension of an Automated Termination Method of Recursive Functions. Int. J. Found. Comput. Sci. 13(3): 361-386 (2002) - [j28]Fairouz Kamareddine:
Special Issue Mechanizing and Automating Mathematics: In honour of N.G. de Bruijn - Preface. J. Autom. Reason. 29(3-4): 183-188 (2002) - [c12]Roel Bloo, Fairouz Kamareddine, Twan Laan, Rob Nederpelt:
Parameters in Pure Type Systems. LATIN 2002: 371-385 - [c11]Fairouz Kamareddine:
On Functions and Types: A Tutorial. SOFSEM 2002: 74-93 - [c10]Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine:
Comparing Calculi of Explicit Substitutions with Eta-reduction. WoLLIC 2002: 76-95 - [c9]Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón:
On automating the extraction of programs from proofs using product types. WoLLIC 2002: 233-253 - 2001
- [j27]Fairouz Kamareddine:
Editorial. Log. J. IGPL 9(3): 335-337 (2001) - [j26]Mauricio Ayala-Rincón, Fairouz Kamareddine:
Unification via the lambda se-Style of Explicit Substitutions. Log. J. IGPL 9(4): 489-523 (2001) - [j25]Fairouz Kamareddine, Twan Laan:
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems. J. Log. Lang. Inf. 10(3): 375-402 (2001) - [j24]Fairouz Kamareddine:
Editorial. J. Log. Comput. 11(3): 359-361 (2001) - [j23]Fairouz Kamareddine:
Reviewing the Classical and the de Bruijn Notation for [lambda]-calculus and Pure Type Systems. J. Log. Comput. 11(3): 363-394 (2001) - [c8]Fairouz Kamareddine, Twan Laan, Rob Nederpelt:
Refining the Barendregt Cube Using Parameters. FLOPS 2001: 375-390 - [c7]Fairouz Kamareddine, Roel Bloo, Rob Nederpelt:
De Bruijn's Syntax and Reductional Equivalence of Lambda-Terms. PPDP 2001: 16-27 - 2000
- [j22]Fairouz Kamareddine, Jan Willem Klop:
Editorial. J. Log. Comput. 10(3): 321-322 (2000) - [j21]Fairouz Kamareddine, Alejandro Ríos:
Relating the λσ- and λs-styles of explicit substitutions. J. Log. Comput. 10(3): 349-380 (2000) - [j20]Fairouz Kamareddine:
Postponement, conservation and preservation of strong normalization for generalized reduction. J. Log. Comput. 10(5): 721-738 (2000) - [c6]Mauricio Ayala-Rincón, Fairouz Kamareddine:
Unification via se-style of explicit substitution. PPDP 2000: 163-174
1990 – 1999
- 1999
- [j19]Fairouz Kamareddine, Roel Bloo, Rob Nederpelt:
On Pi-Conversion in the lambda-Cube and the Combination with Abbreviations. Ann. Pure Appl. Log. 97(1-3): 27-45 (1999) - [c5]Fairouz Kamareddine, François Monin:
On Automating Inductive and Non-inductive Termination Methods. ASIAN 1999: 177-189 - [c4]Fairouz Kamareddine, François Monin:
On Formalised Proofs of Termination of Recursive Functions. PPDP 1999: 29-46 - 1998
- [j18]Fairouz Kamareddine, Alejandro Ríos:
Bridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi. Log. J. IGPL 6(6): 843-874 (1998) - [j17]Fairouz Kamareddine:
The Soundness of Explicit Substitution with Nameless Variables. Int. J. Found. Comput. Sci. 9(3): 321- (1998) - [j16]Fairouz Kamareddine, Alejandro Ríos, J. B. Wells:
Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions. J. Funct. Log. Program. 1998(5) (1998) - 1997
- [j15]Fairouz Kamareddine, Alejandro Ríos:
Extending a lambda-Calculus with Explicit Substitution which Preserves Strong Normalisation Into a Confluent Calculus on Open Terms. J. Funct. Program. 7(4): 395-420 (1997) - [c3]Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos:
Explicit Substitutions for the Lambda-Calculus. ALP/HOA 1997: 209-223 - 1996
- [j14]Roel Bloo, Fairouz Kamareddine, Rob Nederpelt:
The Barendregt Cube with Definitions and Generalised Reduction. Inf. Comput. 126(2): 123-143 (1996) - [j13]Fairouz Kamareddine, Twan Laan:
A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths. Log. J. IGPL 4(2): 195-213 (1996) - [j12]Fairouz Kamareddine, Rob Nederpelt:
Canonical Typing and Pi-Conversion in the Barendregt Cube. J. Funct. Program. 6(2): 245-267 (1996) - [j11]Fairouz Kamareddine, Rob Nederpelt:
A Useful lambda-Notation. Theor. Comput. Sci. 155(1): 85-109 (1996) - [c2]Fairouz Kamareddine, Alejandro Ríos:
Generalized beta-Reduction and Explicit Substitution. PLILP 1996: 378-392 - 1995
- [j10]Fairouz Kamareddine:
Important Issues in Foundational Formalisms. Log. J. IGPL 3(2-3): 291-317 (1995) - [j9]Fairouz Kamareddine, Rob Nederpelt:
Refining Reduction in the Lambda Calculus. J. Funct. Program. 5(4): 637-651 (1995) - [j8]Fairouz Kamareddine:
A Type Free Theory and Collective/Distributive Predication. J. Log. Lang. Inf. 4(2): 85-109 (1995) - [c1]Fairouz Kamareddine, Alejandro Ríos:
A Lambda-Calculus à la de Bruijn with Explicit Substitutions. PLILP 1995: 45-62 - 1994
- [j7]Fairouz Kamareddine, Rob Nederpelt:
A Unified Approach to Type Theory Through a Refined lambda-Calculus. Theor. Comput. Sci. 136(1): 183-216 (1994) - 1993
- [j6]Fairouz Kamareddine, Rob Nederpelt:
On Stepwise Explicit Substitution. Int. J. Found. Comput. Sci. 4(3): 197-240 (1993) - [j5]Fairouz Kamareddine, Ewan Klein:
Polymorphism, Type containment and Nominalization. J. Log. Lang. Inf. 2(3): 171-215 (1993) - 1992
- [j4]Fairouz Kamareddine:
λ-Terms, Logic, Determiners and Quantifiers. J. Log. Lang. Inf. 1(1): 79-104 (1992) - [j3]Fairouz Kamareddine:
Set Theory and Nominalization, Part I. J. Log. Comput. 2(5): 579-604 (1992) - [j2]Fairouz Kamareddine:
Set Theory and Nominalization, Part II. J. Log. Comput. 2(6): 687-707 (1992) - [j1]Fairouz Kamareddine:
A System at the Cross-Roads of Functional and Logic Programming. Sci. Comput. Program. 19(3): 239-279 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
