Kamareddine, Fairouz - Computer Science Department, Heriot-Watt University

Advanced Search

Kamareddine, Fairouz - Computer Science Department, Heriot-Watt University

Is the se-calculus strongly normalising? ? Fairouz Kamareddine 1 , and Alejandro R os 2
A Semantics for stepwise substitution and reduction \Lambday Fairouz Kamareddine z
Computerizing Mathematical Text with Fairouz Kamareddine and J. B. Wells
Important Issues in Foundational FAIROUZ KAMAREDDINE, Department of Computing Science,
Generalised fireduction and explicit substitutions
NDIMENSIONAL AFFINE WEYLHEISENBERG WAVELETS C. Kalisa*, B. Torr'esani**
Parameters in Pure Type Systems Roel Bloo ? , Fairouz Kamareddine ?? , Twan Laan ? ? ? , and Rob Nederpelt y
Capsule Reviews Fairouz Kamareddine
Capsule Reviews The Capsule Reviews are intended to provide a short succinct review of each paper in the issue, in
Capsule Reviews FAIROUZ KAMAREDDINE
Formalizing Belief Revision in Type Tijn Borghuis, Mathematics and Computing Science, Technische
Terms, Logic, Determiners and Quantifiers the Journal of Logic, Language and Information 1(1),
SUBSEXPL: A Tool for Simulating and Comparing Explicit Substitutions Calculi #
Capsule Reviews Fairouz Kamareddine
DRAFT r2462 --DRAFT r2462 --DRAFT r2462 --DRA Gradual computerisation/formalisation of
Set Theory and Nominalisation, Part I Journal of Logic and Computation, 2(5), 579604, 1992
Are Types needed for Natural Language? In Applied Logic: How, What and Why, P'olos and Masuch
A system at the crossroads of functional and logic programming
Canonical typing and \Piconversion \Lambda Fairouz Kamareddine y
Strategies for Simply-Typed Higher Order Uni cation via s e -Style of Explicit Substitution
Unification via s e Style of Explicit Substitution
On automating the extraction of programs from termination proofs
Comparing and Implementing Calculi of Explicit Substitutions with Eta-Reduction
Electronic Notes in Theoretical Computer Science 85 No. 7 (2003) URL: http://www.elsevier.nl/locate/entcs/volume85.html 20 pages
A complete realisability semantics for intersection types and arbitrary expansion
Review for HPL 2008 Giuseppe Primiero, Information and Knowledge: A Constructive Type-
De Bruijn's Automath and Pure Type Systems Fairouz Kamareddine Twan Laan y Rob Nederpelt z
The scalculus: its typed and its extended versions Fairouz Kamareddine and Alejandro R'ios \Lambda
IJFCS.sty file International Journal of Foundations of Computer Science
Electronic Notes in Theoretical Computer Science 67 (2002) URL: http://www.elsevier.nl/locate/entcs/volume67.html 21 pages
The Barendregt Cube with Definitions and Generalised Appears in Information and Computation 126(2), 123143,
De Bruijn's syntax and reductional behaviour of -terms: the typed case
A Reflection on Russell's Ramified Types and Kripke's Hierarchy of
Explicit substitutions for the \Deltacalculus ? Gilles Barthe 1 Fairouz Kamareddine 2 Alejandro R'ios 2
THIRTY FIVE YEARS OF AUTOMATING MATHEMATICS: DEDICATED TO 35 YEARS OF
Intersection type systems and explicit substitutions calculi
Simplified Reducibility Proofs of Church-Rosser for -and -reduction
c British Computer Society 2002 Capsule Reviews
Capsule Reviews FAIROUZ KAMAREDDINE
A complete realisability semantics for intersection types and infinite expansion variables
BELIEF REVISION IN TYPE THEORY TIJN BORGHUISyAND FAIROUZ KAMAREDDINEzAND ROB NEDERPELTy
Published by Oxford University Press on behalf of the British Computer Society 2005. doi:10.1093/comjnl/bxh095
Definitions and \Piconversion in Type Theory \Lambday Fairouz Kamareddine z , Roel Bloo x and Rob Nederpelt --
On \Piconversion in the cube and the combination with abbreviations
Refining Reduction in the lambda calculus Journal of Functional Programming 5(4), 1995 \Lambda
A useful notation \Lambda Fairouz Kamareddine y
Explicit substitutions for control operators ? Gilles Barthe ?? , Fairouz Kamareddine ??? , and Alejandro R'ios y
Volume 9 Number 3 May 2001 LOGIC JOURNAL
On Applying the s e -Style of Uni cation for
De Bruijn's syntax and reductional behaviour of -terms: the untyped case
Types in Logic and Mathematics before 1940 Fairouz Kamareddine y Twan Laan z Rob Nederpelt x
Efficiency of calculi with explicit substitutions \Lambda Fairouz Kamareddine and Alejandro R'ios y
The cube with classes which approximate reductional equivalence \Lambda
A MathLang Path into a Coq Proof Skeleton Fairouz Kamareddine1
c British Computer Society 2003 Capsule Reviews
A refinement of de Bruijn's formal language of mathematics Fairouz Kamareddine (fairouz@macs.hw.ac.uk) +
Beyond fiReduction in Church's ! \Lambda Department of Mathematics and Computing Science
The Barendregt Cube with Definitions and Generalised Reduction \Lambda
ON STEPWISE EXPLICIT SUBSTITUTION International Journal of Foundations of Computer Science 4(3), 197240, 1993.
Realisability Semantics for Intersection Types and Expansion Variables
Term Reshuffling in the Barendregt Cube \Lambda Roel Bloo y , Fairouz Kamareddine z , Rob Nederpelt x
MathLang: experience-driven development of a new mathematical language
Capsule Reviews Hardware-Oriented Algorithms for Rendering Order-
On Formalised Proofs of Termination of Recursive Functions ?
A reduction relation for which postponement of Kcontractions, Conservation and Preservation of Strong Normalisation hold \Lambda
Canonical typing and \Piconversion in the Barendregt Cube Journal of Functional Programming 6(2), 1995 \Lambda
Simple-Typed Higher-Order
Bridging de Bruijn indices and variable names in explicit substitutions calculi \Lambda
A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths \Lambda
The confluence of the s e calculus via a generalized interpretation method \Lambda
The Journal of Functional and Logic Programming
Replace this le with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
Membrane: Operating System Support for Restartable File Systems Swaminathan Sundararaman, Sriram Subramanian, Abhishek Rajimwale,
De Bruijn's syntax and reductional equivalence of terms Fairouz Kamareddine
Mechanizing and Automating Mathematics: In honor of N.G. de Bruijn
Bridging de Bruijn Indices and Variable Names in Explicit
Bridging the oe and sStyles of Explicit Substitutions ?
Uni cation via the s e Explicit Substitutions
Relating the -and s-Styles of Explicit Substitutions
Revisiting the notion of function Fairouz Kamareddine 1 and Twan Laan 2 and Rob Nederpelt 3
Electronic Notes in Theoretical Computer Science 85 No. 7 (2003) URL: http://www.elsevier.nl/locate/entcs/volume85.html 20 pages
Capsule Reviews Fairouz Kamareddine
Narrative Structure of Mathematical Texts Fairouz Kamareddine, Manuel Maarek, Krzysztof Retel, and J. B. Wells
Reducibility proofs in the -calculus Fairouz Kamareddine and Vincent Rahli
Pure Type Systems with de Bruijn indices ? Fairouz Kamareddine 1 , and Alejandro R os 2
A MathLang Path into a Coq Proof Skeleton Fairouz Kamareddine1
Type theories support increasingly the expressiveness of programming languages, theorem provers and logics without losing important theoretical properties. Thus, type theories are the
A completeness result for a realisability semantics for an intersection type system
Important Issues in Foundational Formalisms \Lambda Fairouz Kamareddine y
Generalized fireduction and explicit substitutions \Lambda Fairouz Kamareddine and Alejandro R'ios y
Review for HPL 2007 Paul Gilmore, Logicism Renewed: Logical Foundations for Mathemat-
Re ning the Barendregt Cube using Parameters ? Fairouz Kamareddine ??1 , Twan Laan 2 , and Rob Nederpelt 3
The Bulletin of Symbolic Logic Volume 8, Number 2, June 2002
A refinement of de Bruijn's formal language of mathematics Fairouz Kamareddine (fairouz@macs.hw.ac.uk)
Restoring Natural Language as a Computerised Mathematics Input Method
(Higher-Order) substitution
J. Functional Programming 1 (1): 1--000, January 1993 c fl 1993 Cambridge University Press 1
Electronic Notes in Theoretical Computer Science 67 (2002) URL: http://www.elsevier.nl/locate/entcs/volume67.html 20 pages
International Journal of Foundations of Computer Science World Scienti c Publishing Company
Capsule Reviews FAIROUZ KAMAREDDINE
F. Kamareddine, M. Maarek, K. Retel and J. B. Wells
ON APPLYING THE s e -STYLE OF UNIFICATION
A Correspondence between Nuprl, the Ramified Theory of Types and Pure Type Systems \Lambda
Calculi of Generalised fiReduction and Explicit Substitutions: The Type Free and Simply Typed Versions \Lambda
Capsule Reviews FAIROUZ KAMAREDDINE
Capsule Reviews Fairouz Kamareddinne
Subscription Information Volume 10, 2002 (bimonthly) Full: Europe pounds sterling 275; Rest of World US$
Set Theory and Nominalisation, Part II Journal of Logic and Computation, 2(6), 687707, 1992
A calculus `a la de Bruijn with explicit substitutions
A Correspondence between Martin-Lof Type Theory, the Rami ed Theory of Types and Pure
Capsule Reviews FAIROUZ KAMAREDDINE
c British Computer Society 2003 Capsule Reviews
Capsule reviews FAIROUZ KAMAREDDINE
An abstract syntax for a formal language of mathematics Rob Nederpelt 1 and Fairouz Kamareddine 2
An approximation of reductional equivalence \Lambda Fairouz Kamareddine Roel Bloo and Rob Nederpelt
Postponement, Conservation and Preservation of Strong Normalisation for Generalised Reduction
THIRTY FIVE YEARS OF AUTOMATING MATHEMATICS: DEDICATED TO 35 YEARS OF
Formalising Strong Normalisation proofs of Explicit Substitution Calculi in ALF y
Nominalization, Predication and Type Containment
Capsule Reviews Fairouz Kamareddine
Reviewing the classical and the de Bruijn notation for -calculus and pure type systems
Kamareddine (Heriot-Watt
A unified approach to Type Theory through a refined Theoretical Computer Science 136 (1994) 183216 \Lambda
On \Piconversion in the cube and the combination with abbreviations
Explicit Substitutions Calculi with Explicit Eta Rules
Reducibility proofs in -calculi with intersection types Fairouz Kamareddine, Vincent Rahli, and J. B. Wells
Fundamenta Informaticae XXI (2001) 10011029 1001 Challenges and Solutions to Realisability Semantics for Intersection
Fundamenta Informaticae XXI (2001) 10011075 1001 Challenges and Solutions to Realisability Semantics for Intersection
Fundamenta Informaticae XX (2008) 127 1 Reducibility proofs in the -calculus
Fundamenta Informaticae XX (2008) 188 1 Reducibility proofs in the -calculus
2008-10-20 22:47SECOM -Secretaria de Comunicao da Universidade de Braslia (UnB) Page 1 of 3http://www.secom.unb.br/unbagencia/ag1007-73.htm
Explicit Substitutions Calculi with One Step Eta-reduction Decided
Higher-Order Unification: A structural relation between Huet's method and the one
The 20th century gave birth to a computer technology that has dominated our lives. Such technology may be expensive to build and/or human lives may depend on it.
MathLang Translation to Isabelle Syntax Robert Lamar, Fairouz Kamareddine, and J. B. Wells
Example supplement for "Restoring Natural Language as a Computerised
Toward an Object-Oriented Structure for Mathematical Text
Second-Order Matching via Explicit Substitutions
Diagrams for Meaning Preservation J. B. Wells1
M. Fernandez (Ed.): 9th Int. Workshop on Reduction Strategies in Rewriting and Programming (WRS'09)
Simplified Reducibility Proofs of Church-Rosser for -and -reduction
Developing Realisability Semantics for Intersection Types and Expansion Variables
Capsule Reviews FAIROUZ KAMAREDDINE
Capsule Reviews FAIROUZ KAMAREDDINE
c British Computer Society 2003 In Memoriam Roger Needham
c British Computer Society 2003 Capsule Reviews
c British Computer Society 2002 Capsule Reviews
On Functions and Types Fairouz Kamareddine
A Semantics for a fine calculus with de Bruijn indices \Lambda Fairouz Kamareddine y
A type free theory and collective/distributive predication the Journal of Logic, Language and Information 4, 1995
On Automating Inductive and NonInductive Termination Methods
A Correspondence between Martin-Lof Type Theory, the Rami ed Theory of Types and Pure