The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fairouz Kamareddine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos
    Explicit Substitutions for the Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    ALP/HOA, 1997, pp:209-223 [Conf]
  2. Fairouz Kamareddine, François Monin
    On Automating Inductive and Non-inductive Termination Methods. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:177-189 [Conf]
  3. Fairouz Kamareddine, Twan Laan, Rob Nederpelt
    Refining the Barendregt Cube Using Parameters. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2001, pp:375-390 [Conf]
  4. Roel Bloo, Fairouz Kamareddine, Twan Laan, Rob Nederpelt
    Parameters in Pure Type Systems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:371-385 [Conf]
  5. Flávio L. C. de Moura, Fairouz Kamareddine, Mauricio Ayala-Rincón
    Second-Order Matching via Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:433-448 [Conf]
  6. Fairouz Kamareddine, Manuel Maarek, J. B. Wells
    Flexible Encoding of Mathematics on the Computer. [Citation Graph (0, 0)][DBLP]
    MKM, 2004, pp:160-174 [Conf]
  7. Fairouz Kamareddine, Manuel Maarek, J. B. Wells
    Toward an Object-Oriented Structure for Mathematical Text. [Citation Graph (0, 0)][DBLP]
    MKM, 2005, pp:217-233 [Conf]
  8. Fairouz Kamareddine, Alejandro Ríos
    A Lambda-Calculus `a la de Bruijn with Explicit Substitutions [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:45-62 [Conf]
  9. Fairouz Kamareddine, Alejandro Ríos
    Generalized beta-Reduction and Explicit Substitution. [Citation Graph (0, 0)][DBLP]
    PLILP, 1996, pp:378-392 [Conf]
  10. Mauricio Ayala-Rincón, Fairouz Kamareddine
    Unification via se-style of explicit substitution. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:163-174 [Conf]
  11. Fairouz Kamareddine, Roel Bloo, Rob Nederpelt
    De Bruijn's Syntax and Reductional Equivalence of Lambda-Terms. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:16-27 [Conf]
  12. Fairouz Kamareddine, François Monin
    On Formalised Proofs of Termination of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:29-46 [Conf]
  13. J. B. Wells, Detlef Plump, Fairouz Kamareddine
    Diagrams for Meaning Preservation. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:88-106 [Conf]
  14. Fairouz Kamareddine
    On Functions and Types: A Tutorial. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2002, pp:74-93 [Conf]
  15. Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine
    Comparing and implementing calculi of explicit substitutions with eta-reduction. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:1, pp:5-41 [Journal]
  16. Fairouz Kamareddine, Roel Bloo, Rob Nederpelt
    On Pi-Conversion in the lambda-Cube and the Combination with Abbreviations. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:97, n:1-3, pp:27-45 [Journal]
  17. Fairouz Kamareddine, Twan Laan, Rob Nederpelt
    Types in logic and mathematics before 1940. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2002, v:8, n:2, pp:185-245 [Journal]
  18. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:3, pp:257-258 [Journal]
  19. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:4, pp:382-384 [Journal]
  20. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:5, pp:501- [Journal]
  21. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:6, pp:627-629 [Journal]
  22. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:1, pp:1-3 [Journal]
  23. Fairouz Kamareddine, Alejandro Ríos
    Pure Type Systems with de Bruijn Indices. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2002, v:45, n:2, pp:187-201 [Journal]
  24. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:255-257 [Journal]
  25. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:5, pp:505-506 [Journal]
  26. Fairouz Kamareddinne
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:4, pp:381-382 [Journal]
  27. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:6, pp:631-633 [Journal]
  28. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2007, v:50, n:1, pp:1-3 [Journal]
  29. Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine
    Comparing Calculi of Explicit Substitutions with Eta-reduction. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:67, n:, pp:- [Journal]
  30. Herman Geuvers, Fairouz Kamareddine
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:85, n:7, pp:- [Journal]
  31. Fairouz Kamareddine
    Mathematical Knowledge Management Symposium 2003. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:93, n:, pp:1-4 [Journal]
  32. Fairouz Kamareddine, Twan Laan, Rob Nederpelt
    Automath and Pure Type Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:85, n:7, pp:- [Journal]
  33. Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón
    On automating the extraction of programs from proofs using product types. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:67, n:, pp:- [Journal]
  34. Fairouz Kamareddine, Manuel Maarek, J. B. Wells
    MathLang: Experience-driven Development of a New Mathematical Language. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:93, n:, pp:138-160 [Journal]
  35. Fairouz Kamareddine, Alejandro Ríos
    Explicit substitutions à la de Bruijn: the local and global way. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:85, n:7, pp:- [Journal]
  36. Roel Bloo, Fairouz Kamareddine, Rob Nederpelt
    The Barendregt Cube with Definitions and Generalised Reduction. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:126, n:2, pp:123-143 [Journal]
  37. Mauricio Ayala-Rincón, Fairouz Kamareddine
    Unification via the lambda se-Style of Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2001, v:9, n:4, pp:- [Journal]
  38. Tijn Borghuis, Fairouz Kamareddine, Rob Nederpelt
    Formalizing Belief Revision in Type Theory. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2002, v:10, n:5, pp:461-500 [Journal]
  39. Fairouz Kamareddine
    Editorial. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2001, v:9, n:3, pp:- [Journal]
  40. Fairouz Kamareddine, Alejandro Ríos
    Bridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1998, v:6, n:6, pp:843-874 [Journal]
  41. Fairouz Kamareddine
    The Soundness of Explicit Substitution with Nameless Variables. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:3, pp:321-0 [Journal]
  42. Fairouz Kamareddine, François Monin
    An Extension of an Automated Termination Method of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:3, pp:361-386 [Journal]
  43. Fairouz Kamareddine, Rob Nederpelt
    On Stepwise Explicit Substitution. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:197-240 [Journal]
  44. Flávio L. C. de Moura, Mauricio Ayala-Rincón, Fairouz Kamareddine
    SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2006, v:16, n:1-2, pp:119-150 [Journal]
  45. Fairouz Kamareddine
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2004, v:2, n:2, pp:169-172 [Journal]
  46. Fairouz Kamareddine
    Special Issue Mechanizing and Automating Mathematics: In honour of N.G. de Bruijn - Preface. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2002, v:29, n:3-4, pp:183-188 [Journal]
  47. Fairouz Kamareddine, Qiao Haiyan
    Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:30, n:1, pp:59-98 [Journal]
  48. Fairouz Kamareddine, Alejandro Ríos, J. B. Wells
    Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 1998, v:1998, n:5, pp:- [Journal]
  49. Fairouz Kamareddine, Rob Nederpelt
    Canonical Typing and Pi-Conversion in the Barendregt Cube. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:2, pp:245-267 [Journal]
  50. Fairouz Kamareddine, Rob Nederpelt
    Refining Reduction in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1995, v:5, n:4, pp:637-651 [Journal]
  51. Fairouz Kamareddine, Alejandro Ríos
    Extending a lambda-Calculus with Explicit Substitution which Preserves Strong Normalisation Into a Confluent Calculus on Open Terms. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:4, pp:395-420 [Journal]
  52. Fairouz Kamareddine
    Typed lambda-calculi with one binder. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2005, v:15, n:5, pp:771-796 [Journal]
  53. Fairouz Kamareddine, Roel Bloo
    De Bruijn's syntax and reductional behaviour of lambda-terms: the untyped case. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:62, n:1, pp:109-131 [Journal]
  54. Fairouz Kamareddine, Roel Bloo
    De Bruijn's syntax and reductional behaviour of lambda-terms: the typed case. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:62, n:2, pp:159-189 [Journal]
  55. Fairouz Kamareddine, Twan Laan, Rob Nederpelt
    Revisiting the notion of function. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2003, v:54, n:1-2, pp:65-107 [Journal]
  56. Fairouz Kamareddine, Ewan Klein
    Polymorphism, Type containment and Nominalization. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1993, v:2, n:3, pp:171-215 [Journal]
  57. Fairouz Kamareddine
    Lambda-Terms, Logic, Determiners and Quantifiers. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1992, v:1, n:1, pp:79-104 [Journal]
  58. Fairouz Kamareddine
    A Type Free Theory and Collective/Distributive Predication. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1995, v:4, n:2, pp:85-109 [Journal]
  59. Fairouz Kamareddine, Twan Laan
    A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2001, v:10, n:3, pp:375-402 [Journal]
  60. Fairouz Kamareddine, Rob Nederpelt
    A Refinement of de Bruijn's Formal Language of Mathematics. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2004, v:13, n:3, pp:287-340 [Journal]
  61. Fairouz Kamareddine
    Postponement, conservation and preservation of strong normalization for generalized reduction. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2000, v:10, n:5, pp:721-738 [Journal]
  62. Fairouz Kamareddine
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2001, v:11, n:3, pp:359-361 [Journal]
  63. Fairouz Kamareddine
    Reviewing the Classical and the de Bruijn Notation for [lambda]-calculus and Pure Type Systems. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2001, v:11, n:3, pp:363-394 [Journal]
  64. Fairouz Kamareddine
    Set Theory and Nominalization, Part I. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:5, pp:579-604 [Journal]
  65. Fairouz Kamareddine
    Set Theory and Nominalization, Part II. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:6, pp:687-707 [Journal]
  66. Fairouz Kamareddine, Jan Willem Klop
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2000, v:10, n:3, pp:321-322 [Journal]
  67. Fairouz Kamareddine, Alejandro Ríos
    Relating the [lgr][sgr]- and [lgr]s-styles of explicit substitutions. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2000, v:10, n:3, pp:349-380 [Journal]
  68. Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón
    On Automating the Extraction of Programs from Termination Proofs. [Citation Graph (0, 0)][DBLP]
    Revista Comlombiana de Computación, 2003, v:4, n:2, pp:- [Journal]
  69. Fairouz Kamareddine
    A System at the Cross-Roads of Functional and Logic Programming. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1992, v:19, n:3, pp:239-279 [Journal]
  70. Fairouz Kamareddine, Rob Nederpelt
    A Unified Approach to Type Theory Through a Refined lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:136, n:1, pp:183-216 [Journal]
  71. Fairouz Kamareddine, Rob Nederpelt
    A Useful lambda-Notation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:1, pp:85-109 [Journal]
  72. Fairouz Kamareddine, Robert Lamar, Manuel Maarek, J. B. Wells
    Restoring Natural Language as a Computerised Mathematics Input Method. [Citation Graph (0, 0)][DBLP]
    Calculemus/MKM, 2007, pp:280-295 [Conf]
  73. Fairouz Kamareddine, Manuel Maarek, Krzysztof Retel, J. B. Wells
    Narrative Structure of Mathematical Texts. [Citation Graph (0, 0)][DBLP]
    Calculemus/MKM, 2007, pp:296-312 [Conf]
  74. Fairouz Kamareddine, Karim Nour
    A completeness result for a realisability semantics for an intersection type system. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2007, v:146, n:2-3, pp:180-198 [Journal]
  75. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2007, v:50, n:3, pp:251-253 [Journal]
  76. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2007, v:50, n:4, pp:373-374 [Journal]
  77. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2007, v:50, n:2, pp:131-133 [Journal]
  78. Ariel Arbiser, Fairouz Kamareddine, Alejandro Ríos
    The Weak Normalization of the Simply Typed lambda-se-calculus. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2007, v:15, n:2, pp:121-147 [Journal]

  79. Principal Typings for Explicit Substitutions Calculi. [Citation Graph (, )][DBLP]


  80. A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. [Citation Graph (, )][DBLP]


  81. MathLang Translation to Isabelle Syntax. [Citation Graph (, )][DBLP]


  82. The Gradual Computerisation of Mathematics in MathLang. [Citation Graph (, )][DBLP]


  83. Intersection Type Systems and Explicit Substitutions Calculi. [Citation Graph (, )][DBLP]


  84. Capsule Reviews. [Citation Graph (, )][DBLP]


  85. Capsule Reviews. [Citation Graph (, )][DBLP]


  86. Capsule reviews. [Citation Graph (, )][DBLP]


  87. Capsule Reviews. [Citation Graph (, )][DBLP]


  88. Capsule Reviews. [Citation Graph (, )][DBLP]


  89. Capsule Reviews. [Citation Graph (, )][DBLP]


  90. Capsule Reviews. [Citation Graph (, )][DBLP]


  91. Capsule Reviews. [Citation Graph (, )][DBLP]


  92. Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices [Citation Graph (, )][DBLP]


  93. Computerizing Mathematical Text with MathLang. [Citation Graph (, )][DBLP]


  94. Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction. [Citation Graph (, )][DBLP]


  95. Preface. [Citation Graph (, )][DBLP]


Search in 0.254secs, Finished in 0.258secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002