• Publications
  • Influence
Perpetual Reductions in Lambda-Calculus
TLDR
This paper surveys a part of the theory ofs-reduction in?-calculus which might aptly be calledperpetual reductions. Expand
  • 55
  • 5
Pure Type Systems with Definitions
TLDR
An extension of Pure Type Systems with definitions is presented. Expand
  • 64
  • 3
  • PDF
On normalisation
Using a characterisation of strongly normalising $\lambda$-terms, we give new and simple proofs of the following: all developments and superdevelopments are finite, a certain rewrite strategy isExpand
  • 43
  • 2
An Extensional Böhm Model
TLDR
We show the existence of an infinitary confluen t and normalising extension of the finite extensional lambda calculus with beta and eta, and a simple syntax based proof that two lambda terms have the same semantics in this model. Expand
  • 25
  • 1
  • PDF
Web Semantics: Science, Services and Agents on the World Wide Web
TLDR
We introduce the Description Logic SHIQM which is obtained from SHIQ by adding statements that equate individuals to concepts in a knowledge base. Expand
  • 22
  • 1
  • PDF
Type Inference for Pure Type Systems
  • P. Severi
  • Computer Science, Mathematics
  • Inf. Comput.
  • 25 May 1998
TLDR
We define a type inference semi-algorithm for singly sorted pure type systems without the Φ -condition. Expand
  • 15
  • 1
Order Structures on Böhm-Like Models
TLDR
We are interested in the question whether the models induced by the infinitary lambda calculus are orderable, that is whether they have a partial order with least element making the context operators monotone. Expand
  • 12
  • 1
  • PDF
Reasoning for ALCQ Extended with a Flexible Meta-Modelling Hierarchy
TLDR
This works is motivated by a real-world case study where it is necessary to integrate and relate existing ontologies through meta- modelling. Expand
  • 12
  • 1
  • PDF
Observational Equivalence for Multiparty Sessions
  • 4
  • 1
...
1
2
3
4
5
...