Alain Desreumaux

Alain Desreumaux[1][2] (born 1944, Stains) is a French historian of religion, specializing on Syrian and Aramaic christo-palestinian communities.[3] He has uncovered manuscripts and inscriptions and published works on codicology and epigraphy.

He is president and cofounder of the Société d'études syriaques.

Works
  • 1997: Doctrine de l’Apôtre Addaï, dans Les Écrits Apocryphes Chrétiens I - Bibliothèque de la Pléiade 442 - Éditions Gallimard, Paris
  • Histoire du roi Abgar et de Jésus : Presentation and translation of the full Syrian text of the Addai doctrine (Brepols)
  • Khirbet Es-Samra I: the first volume is entitled Khirbet es-Samra I. It was prepared under the direction of Jean-Baptiste Humbert and Alain Desreumaux, and under the aegis of the "École biblique et archéologique française de Jérusalem" and the "Centre d'études des religions du Livre du CNRS".
  • 2004:Les Études syriaques - publiées par la Société d'études syriaques ; dir. Alain Desreumaux, Françoise Briquel Chatonnet, Muriel Debié. Geuthner; series Études syriaques. - 956 (21) + 492.3 (21) - ISSN 1771-6144 = Études syriaques.
  • 2003: Manuscrits chrétiens du Proche-Orient - [printed text] / Françoise Briquel-Chatonnet, Alain Desreumaux, Maria Gorea ... [et al.] ; published by the Centre de conservation du livre (Arles) and the Manumed
  • 2006: Voyage dans la diversité chrétienne - by Alain Desreumaux - Le Monde de la Bible - 174, November–December
  • 2010: Sur les pas des Araméens chrétiens : festschrift to Alain Desreumaux, Geuthner
gollark: `greenery` can do the complement/inverse of regexes, at least.
gollark: Interesting question. Probably. I don't know how you could construct that.
gollark: I think that technically makes it not a *regular* regular expression.
gollark: My thing works by building a weirdly structured finite-state machine which matches permutations of "regex", then converting it to a different flat one usable by the `greenery` library, then using it to very slowly convert that into a regex.
gollark: I made a regex which matches all anagrams of regex: `e(e(g(rx|xr)|r(gx|xg)|x(gr|rg))|g(e(rx|xr)|r(ex|xe)|x(er|re))|r(e(gx|xg)|g(ex|xe)|x(eg|ge))|x(e(gr|rg)|g(er|re)|r(eg|ge)))|g(e(e(rx|xr)|r(ex|xe)|x(er|re))|r(e(ex|xe)|xe{2})|x(e(er|re)|re{2}))|r(e(e(gx|xg)|g(ex|xe)|x(eg|ge))|g(e(ex|xe)|xe{2})|x(e(eg|ge)|ge{2}))|x(e(e(gr|rg)|g(er|re)|r(eg|ge))|g(e(er|re)|re{2})|r(e(eg|ge)|ge{2}))`.

References
  1. Notice du laboratoire d'études sur les monothéismes du CNRS
  2. Notice sur le site officiel de l'UMR de l'Orient & Méditerranée (Paris)
  3. Conférences sur les manuscrits, les inscriptions, l'histoire et l'archéologie dans les études araméennes et christo-palestiniennes
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.