#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1980

2013

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Fairouz Kamareddine, Roel Bloo, Rob Nederpelt
- Ann. Pure Appl. Logic
- 1999

Typed d-calculus uses two abstraction symbols (A and IT) which are usually treated in different ways: &*.x has as type the abstraction l7, * .*, yet IT, *. * has type 0 rather than an abstraction;â€¦ (More)

- Tijn Borghuis, Fairouz Kamareddine, Rob Nederpelt
- Logic Journal of the IGPL
- 2002

This paper formalizes belief revision for belief states in type theory. Type theory has been influential in logic and computer science but as far as we know, this is the first account at using typeâ€¦ (More)

- Herman Geuvers, Rob Nederpelt
- RTA
- 2004

Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ordinary mathematicalâ€¦ (More)

- Fairouz Kamareddine, Twan Laan, Rob Nederpelt
- Electr. Notes Theor. Comput. Sci.
- 2003

We study the position of Automath systems within the framework of the Pure Type Systems as discussed in 3].

- Fairouz Kamareddine, Twan Laan, Rob Nederpelt
- Bulletin of Symbolic Logic
- 2002

- Roel Bloo, Fairouz Kamareddine, Rob Nederpelt
- Inf. Comput.
- 1996

In this paper, we propose to extend the Barendregt Cube by generalising -reduction and by adding de nition mechanisms. Generalised reduction allows contracting more visible redexes than usual, and deâ€¦ (More)

In this article, we introduce a-notation that is useful for many concepts of the-calculus. The new notation is a simple translation of the classical one. Yet, it provides many nice advantages. First,â€¦ (More)

- Fairouz Kamareddine, Rob Nederpelt
- Journal of Logic, Language and Information
- 2004

syntax for the category of statementsis: S = CS (! P )jBSZ(E)jVS : Examples ofCS (! P ) were given in Example 2.3. An example of BSZ(E) (with the8-binder forBS ) was given in Section 2.5. 2.7.1.â€¦ (More)

- Fairouz Kamareddine, Rob Nederpelt
- J. Funct. Program.
- 1995

Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A general conservative extension theoremâ€¦ (More)

First of all, we are very grateful to our colleague Bert van Benthem Jutting who has read draft versions of the manuscript, and who has made very useful suggestions. Furthermore, we are grateful forâ€¦ (More)