Fairouz Kamareddine

	2012
116		Fairouz Kamareddine: Capsule Reviews. Comput. J. 55(1): 1-2 (2012)
115		Fairouz Kamareddine: Capsule Reviews. Comput. J. 55(2): 133-135 (2012)
114		Fairouz Kamareddine: Capsule Reviews. Comput. J. 55(3): 253-255 (2012)
113		Fairouz Kamareddine: Capsule Reviews. Comput. J. 55(4): 379-381 (2012)
	2011
112		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(10): 1561-1564 (2011)
111		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(11): 1737-1740 (2011)
110		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(12): 1925-1927 (2011)
109		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(2): 185-186 (2011)
108		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(4): 503-504 (2011)
107		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(5): 639-640 (2011)
106		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(6): 833-835 (2011)
105		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(7): 1005-1009 (2011)
104		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(8): 1233-1234 (2011)
103		Fairouz Kamareddine: Capsule Reviews. Comput. J. 54(9): 1413-1415 (2011)
102		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. Electr. Notes Theor. Comput. Sci. 269: 41-54 (2011)
101		Mauricio Ayala-Rincón, Elaine Pimentel, Fairouz Kamareddine: Preface. Theor. Comput. Sci. 412(37): 4851-4852 (2011)
	2010
100		Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine: Intersection Type Systems and Explicit Substitutions Calculi. WoLLIC 2010: 232-246
99		Fairouz Kamareddine: Capsule Reviews. Comput. J. 53(6): 619-622 (2010)
	2009
98		Robert Lamar, Fairouz Kamareddine, J. B. Wells: MathLang Translation to Isabelle Syntax. Calculemus/MKM 2009: 373-388
97		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
96		Fairouz Kamareddine: Capsule Reviews. Comput. J. 52(2): 169-170 (2009)
95		Fairouz Kamareddine: Capsule Reviews. Comput. J. 52(3): 277-279 (2009)
94		Fairouz Kamareddine: Capsule Reviews. Comput. J. 52(4): 393-394 (2009)
93		Fairouz Kamareddine, Vincent Rahli: Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction. Electr. Notes Theor. Comput. Sci. 247: 85-101 (2009)
92		Mauricio Ayala-Rincón, Fairouz Kamareddine: Preface. Electr. Notes Theor. Comput. Sci. 256: 1-3 (2009)
91		Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine: Explicit substitutions calculi with one step Eta-reduction decided explicitly. Logic Journal of the IGPL 17(6): 697-718 (2009)
	2008
90		Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine: Principal Typings for Explicit Substitutions Calculi. CiE 2008: 567-578
89		Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells: A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. ICTAC 2008: 171-185
88		Fairouz Kamareddine: Capsule Reviews. Comput. J. 51(2): 141-143 (2008)
87		Fairouz Kamareddine: Capsule Reviews. Comput. J. 51(4): 405-407 (2008)
86		Fairouz Kamareddine: Capsule Reviews. Comput. J. 51(6): 609-611 (2008)
85		Fairouz Kamareddine, J. B. Wells: Computerizing Mathematical Text with MathLang. Electr. Notes Theor. Comput. Sci. 205: 5-30 (2008)
84		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. Applied Logic 6(1): 72-108 (2008)
	2007
83		Fairouz Kamareddine, Robert Lamar, Manuel Maarek, J. B. Wells: Restoring Natural Language as a Computerised Mathematics Input Method. Calculemus/MKM 2007: 280-295
82		Fairouz Kamareddine, Manuel Maarek, Krzysztof Retel, J. B. Wells: Narrative Structure of Mathematical Texts. Calculemus/MKM 2007: 296-312
81		Fairouz Kamareddine: The Gradual Computerisation of Mathematics in MathLang. SYNASC 2007: 3
80		Fairouz Kamareddine, Karim Nour: A completeness result for a realisability semantics for an intersection type system. Ann. Pure Appl. Logic 146(2-3): 180-198 (2007)
79		Fairouz Kamareddine: Capsule Reviews. Comput. J. 50(1): 1-3 (2007)
78		Fairouz Kamareddine: Capsule Reviews. Comput. J. 50(2): 131-133 (2007)
77		Fairouz Kamareddine: Capsule Reviews. Comput. J. 50(3): 251-253 (2007)
76		Fairouz Kamareddine: Capsule Reviews. Comput. J. 50(4): 373-374 (2007)
75		Fairouz Kamareddine: Capsule Reviews. Comput. J. 50(5): 501-504 (2007)
74		Fairouz Kamareddine: Capsule reviews. Comput. J. 50(6): 629 (2007)
73		Ariel Arbiser, Fairouz Kamareddine, Alejandro Ríos: The Weak Normalization of the Simply Typed lambda-se-calculus. Logic Journal of the IGPL 15(2): 121-147 (2007)
	2006
72		Fairouz Kamareddine: Capsule Reviews. Comput. J. 49(1): 1-3 (2006)
71		Fairouz Kamareddine: Capsule Reviews. Comput. J. 49(3): 255-257 (2006)
70		Fairouz Kamareddine: Capsule Reviews. Comput. J. 49(4): 381-382 (2006)
69		Fairouz Kamareddine: Capsule Reviews. Comput. J. 49(5): 505-506 (2006)
68		Fairouz Kamareddine: Capsule Reviews. Comput. J. 49(6): 631-633 (2006)
67		Flávio L. C. de Moura, Mauricio Ayala-Rincón, Fairouz Kamareddine: SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi. Journal of Applied Non-Classical Logics 16(1-2): 119-150 (2006)
	2005
66		Fairouz Kamareddine, Manuel Maarek, J. B. Wells: Toward an Object-Oriented Structure for Mathematical Text. MKM 2005: 217-233
65		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. Logic 134(1): 5-41 (2005)
64		Fairouz Kamareddine: Capsule Reviews. Comput. J. 48(3): 257-258 (2005)
63		Fairouz Kamareddine: Capsule Reviews. Comput. J. 48(4): 382-384 (2005)
62		Fairouz Kamareddine: Capsule Reviews. Comput. J. 48(5): 501 (2005)
61		Fairouz Kamareddine: Capsule Reviews. Comput. J. 48(6): 627-629 (2005)
60		Fairouz Kamareddine: Typed lambda-calculi with one binder. J. Funct. Program. 15(5): 771-796 (2005)
59		Fairouz Kamareddine, Roel Bloo: De Bruijn's syntax and reductional behaviour of lambda-terms: the untyped case. J. Log. Algebr. Program. 62(1): 109-131 (2005)
58		Fairouz Kamareddine, Roel Bloo: De Bruijn's syntax and reductional behaviour of lambda-terms: the typed case. J. Log. Algebr. Program. 62(2): 159-189 (2005)
	2004
57		Flávio L. C. de Moura, Fairouz Kamareddine, Mauricio Ayala-Rincón: Second-Order Matching via Explicit Substitutions. LPAR 2004: 433-448
56		Fairouz Kamareddine, Manuel Maarek, J. B. Wells: Flexible Encoding of Mathematics on the Computer. MKM 2004: 160-174
55		Fairouz Kamareddine: Mathematical Knowledge Management Symposium 2003. Electr. Notes Theor. Comput. Sci. 93: 1-4 (2004)
54		Fairouz Kamareddine, Manuel Maarek, J. B. Wells: MathLang: Experience-driven Development of a New Mathematical Language. Electr. Notes Theor. Comput. Sci. 93: 138-160 (2004)
53		Fairouz Kamareddine: Editorial. J. Applied Logic 2(2): 169-172 (2004)
52		Fairouz Kamareddine, Rob Nederpelt: A Refinement of de Bruijn's Formal Language of Mathematics. Journal of Logic, Language and Information 13(3): 287-340 (2004)
	2003
51		J. B. Wells, Detlef Plump, Fairouz Kamareddine: Diagrams for Meaning Preservation. RTA 2003: 88-106
50		Herman Geuvers, Fairouz Kamareddine: Preface. Electr. Notes Theor. Comput. Sci. 85(7): 146-147 (2003)
49		Fairouz Kamareddine, Twan Laan, Rob Nederpelt: Automath and Pure Type Systems. Electr. Notes Theor. Comput. Sci. 85(7): 30-49 (2003)
48		Fairouz Kamareddine, Alejandro Ríos: Explicit substitutions à la de Bruijn: the local and global way. Electr. Notes Theor. Comput. Sci. 85(7): 86-105 (2003)
47		Fairouz Kamareddine, Qiao Haiyan: Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF. J. Autom. Reasoning 30(1): 59-98 (2003)
46		Fairouz Kamareddine, Twan Laan, Rob Nederpelt: Revisiting the notion of function. J. Log. Algebr. Program. 54(1-2): 65-107 (2003)
45		Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón: On Automating the Extraction of Programs from Termination Proofs. Revista Colombiana de Computación 4(2): (2003)
	2002
44		Roel Bloo, Fairouz Kamareddine, Twan Laan, Rob Nederpelt: Parameters in Pure Type Systems. LATIN 2002: 371-385
43		Fairouz Kamareddine: On Functions and Types: A Tutorial. SOFSEM 2002: 74-93
42		Fairouz Kamareddine, Twan Laan, Rob Nederpelt: Types in logic and mathematics before 1940. Bulletin of Symbolic Logic 8(2): 185-245 (2002)
41		Fairouz Kamareddine, Alejandro Ríos: Pure Type Systems with de Bruijn Indices. Comput. J. 45(2): 187-201 (2002)
40		Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón: On automating the extraction of programs from proofs using product types. Electr. Notes Theor. Comput. Sci. 67: 233-253 (2002)
39		Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine: Comparing Calculi of Explicit Substitutions with Eta-reduction. Electr. Notes Theor. Comput. Sci. 67: 76-95 (2002)
38		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)
37		Fairouz Kamareddine: Special Issue Mechanizing and Automating Mathematics: In honour of N.G. de Bruijn - Preface. J. Autom. Reasoning 29(3-4): 183-188 (2002)
36		Tijn Borghuis, Fairouz Kamareddine, Rob Nederpelt: Formalizing Belief Revision in Type Theory. Logic Journal of the IGPL 10(5): 461-500 (2002)
	2001
35		Fairouz Kamareddine, Twan Laan, Rob Nederpelt: Refining the Barendregt Cube Using Parameters. FLOPS 2001: 375-390
34		Fairouz Kamareddine, Roel Bloo, Rob Nederpelt: De Bruijn's Syntax and Reductional Equivalence of Lambda-Terms. PPDP 2001: 16-27
33		Fairouz Kamareddine: Editorial. J. Log. Comput. 11(3): 359-361 (2001)
32		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)
31		Fairouz Kamareddine, Twan Laan: A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems. Journal of Logic, Language and Information 10(3): 375-402 (2001)
30		Fairouz Kamareddine: Editorial. Logic Journal of the IGPL 9(3): 335-337 (2001)
29		Mauricio Ayala-Rincón, Fairouz Kamareddine: Unification via the lambda se-Style of Explicit Substitutions. Logic Journal of the IGPL 9(4): 489-523 (2001)
	2000
28		Mauricio Ayala-Rincón, Fairouz Kamareddine: Unification via se-style of explicit substitution. PPDP 2000: 163-174
27		Fairouz Kamareddine, Jan Willem Klop: Editorial. J. Log. Comput. 10(3): 321-322 (2000)
26		Fairouz Kamareddine, Alejandro Ríos: Relating the [lgr][sgr]- and [lgr]s-styles of explicit substitutions. J. Log. Comput. 10(3): 349-380 (2000)
25		Fairouz Kamareddine: Postponement, conservation and preservation of strong normalization for generalized reduction. J. Log. Comput. 10(5): 721-738 (2000)
	1999
24		Fairouz Kamareddine, François Monin: On Automating Inductive and Non-inductive Termination Methods. ASIAN 1999: 177-189
23		Fairouz Kamareddine, François Monin: On Formalised Proofs of Termination of Recursive Functions. PPDP 1999: 29-46
22		Fairouz Kamareddine, Roel Bloo, Rob Nederpelt: On Pi-Conversion in the lambda-Cube and the Combination with Abbreviations. Ann. Pure Appl. Logic 97(1-3): 27-45 (1999)
	1998
21		Fairouz Kamareddine: The Soundness of Explicit Substitution with Nameless Variables. Int. J. Found. Comput. Sci. 9(3): 321- (1998)
20		Fairouz Kamareddine, Alejandro Ríos, J. B. Wells: Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions. Journal of Functional and Logic Programming 1998(5): (1998)
19		Fairouz Kamareddine, Alejandro Ríos: Bridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi. Logic Journal of the IGPL 6(6): 843-874 (1998)
	1997
18		Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos: Explicit Substitutions for the Lambda-Calculus. ALP/HOA 1997: 209-223
17		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)
	1996
16		Fairouz Kamareddine, Alejandro Ríos: Generalized beta-Reduction and Explicit Substitution. PLILP 1996: 378-392
15		Roel Bloo, Fairouz Kamareddine, Rob Nederpelt: The Barendregt Cube with Definitions and Generalised Reduction. Inf. Comput. 126(2): 123-143 (1996)
14		Fairouz Kamareddine, Rob Nederpelt: Canonical Typing and Pi-Conversion in the Barendregt Cube. J. Funct. Program. 6(2): 245-267 (1996)
13		Fairouz Kamareddine, Twan Laan: A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths. Logic Journal of the IGPL 4(2): 195-213 (1996)
12		Fairouz Kamareddine, Rob Nederpelt: A Useful lambda-Notation. Theor. Comput. Sci. 155(1): 85-109 (1996)
	1995
11		Fairouz Kamareddine, Alejandro Ríos: A Lambda-Calculus `a la de Bruijn with Explicit Substitutions PLILP 1995: 45-62
10		Fairouz Kamareddine, Rob Nederpelt: Refining Reduction in the Lambda Calculus. J. Funct. Program. 5(4): 637-651 (1995)
9		Fairouz Kamareddine: A Type Free Theory and Collective/Distributive Predication. Journal of Logic, Language and Information 4(2): 85-109 (1995)
8		Fairouz Kamareddine: Important Issues in Foundational Formalisms. Logic Journal of the IGPL 3(2-3): 291-317 (1995)
	1994
7		Fairouz Kamareddine, Rob Nederpelt: A Unified Approach to Type Theory Through a Refined lambda-Calculus. Theor. Comput. Sci. 136(1): 183-216 (1994)
	1993
6		Fairouz Kamareddine, Rob Nederpelt: On Stepwise Explicit Substitution. Int. J. Found. Comput. Sci. 4(3): 197-240 (1993)
5		Fairouz Kamareddine, Ewan Klein: Polymorphism, Type containment and Nominalization. Journal of Logic, Language and Information 2(3): 171-215 (1993)
	1992
4		Fairouz Kamareddine: Set Theory and Nominalization, Part I. J. Log. Comput. 2(5): 579-604 (1992)
3		Fairouz Kamareddine: Set Theory and Nominalization, Part II. J. Log. Comput. 2(6): 687-707 (1992)
2		Fairouz Kamareddine: Lambda-Terms, Logic, Determiners and Quantifiers. Journal of Logic, Language and Information 1(1): 79-104 (1992)
1		Fairouz Kamareddine: A System at the Cross-Roads of Functional and Logic Programming. Sci. Comput. Program. 19(3): 239-279 (1992)

Coauthor Index

1	Ariel Arbiser	[73]
2	Mauricio Ayala-Rincón	[28] [29] [39] [40] [45] [57] [65] [67] [84] [90] [91] [92] [97] [100] [101] [102]
3	A. V. Barbosa	[102]
4	Gilles Barthe	[18]
5	Roel Bloo	[15] [22] [34] [44] [58] [59]
6	Tijn Borghuis	[36]
7	Herman Geuvers	[50]
8	Qiao Haiyan	[47]
9	Ewan Klein	[5]
10	Jan Willem Klop	[27]
11	Twan Laan	[13] [31] [35] [42] [44] [46] [49]
12	Robert Lamar	[83] [98]
13	Manuel Maarek	[54] [56] [66] [82] [83]
14	François Monin	[23] [24] [38] [40] [45]
15	Flávio L. C. de Moura	[39] [57] [65] [67] [84] [102]
16	Rob Nederpelt	[6] [7] [10] [12] [14] [15] [22] [34] [35] [36] [42] [44] [46] [49] [52]
17	Karim Nour	[80] [89]
18	Elaine Pimentel	[101]
19	Detlef Plump	[51]
20	Vincent Rahli	[89] [93]
21	Krzysztof Retel	[82]
22	Alejandro Ríos	[11] [16] [17] [18] [19] [20] [26] [41] [48] [73]
23	Daniel Lima Ventura	[90] [91] [97] [100]
24	J. B. Wells	[20] [51] [54] [56] [66] [82] [83] [85] [89] [98]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page