DSpace at RU >

Browsing by Faculty / Department Intelligent Systems

Full Text	Issue Date	Title	Author(s)
	1987	Towards an intermediate language based on Graph Rewriting	Barendregt, H.P.; Eekelen, M.C.J.D. van; Glauert, J.R.W.; Kennaway, J.R.; Plasmeijer, M.J., et al
	1991	Modular Proof of Strong Normalization for the Calculus of Constructions	Geuvers, J.H.; Nederhof, MJ
	1991	Proving correctness of logic programs using axiomatic semantics	Colussi, L.; Marchiori, E.
	1992	The Church-Rosser property for βη-reduction in typed λ-calculi	Geuvers, J.H.
	1992	A predicate transformer for unification	Colussi, L.; Marchiori, E.
	1992	Inductive and Coinductive Types with Iteration and Recursion	Geuvers, J.H.
	1992	A theory of first-order built-in's of prolog	Apt, K.R.; Marchiori, E.; Palamidessi, C.
	1993	Borel determinacy without the axiom of choice	Hurkens, A.J.C.
	1994	Untyped lambda-calculus, Typed lambda-calculus, sections 32 and 33	Geuvers, J.H.; Nederpelt, R.P.
	1994	Conservativity between logics and typed λ calculi	Geuvers, J.H.
	1994	A logic for variable aliasing in logic programs	Marchiori, E.
	1994	A declarative approach for first-order built-in's of prolog	Apt, K.R.; Marchiori, E.; Palamidessi, C.
	1994	Modularity of strong normalization and confluence in the algebraic-λ-cube	Barbanera, F.; Fernandez, M.; Geuvers, J.H.
	1994	Reasoning about prolog programs: From modes through types to assertions	Apt, K.R.; Marchiori, E.
	1995	A dataflow semantics for constraint logic programs	Colussi, L.; Marchiori, E.; Marchiori, M.
	1995	Over wiskunde en kunst	Barendregt, H.P.
	1995	On termination of constraint logic programs	Colussi, L.; Marchiori, E.; Marchiori, M.
	1995	Proving termination of logic programs with delay declarations	Marchiori, E.; Teusink, F.J.M.
	1995	The Calculus of Constructions and Higher Order Logic	Geuvers, J.H.
	1996	Forward-tracking: A technique for searching beyond failure	Marchiori, E.; Marchiori, M.; Kok, J.N.