Termination proofs for a lazy functional language by abstract reduction : (draft)

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 6

Classification: Informatik

Event: Veröffentlichung

(where): Frankfurt am Main

(who): Univ.-Bibliothek Frankfurt am Main

(when): 1996

Creator: Panitz, Sven Eric

URN: urn:nbn:de:hebis:30-8938

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:53 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Panitz, Sven Eric
Univ.-Bibliothek Frankfurt am Main

Time of origin

1996

Other Objects (12)

Hochschulschrift

Automated termination proofs

Termination proofs for logic programs

Hochschulschrift

Termination proofs for logic programs

Continuous semantics for termination proofs

Termination Proofs of Rewriting Systems

A region graph based approach to termination proofs

A Region Graph Based Approach to Termination Proofs

Termination proofs and derivation lengths in term rewriting systems

Hochschulschrift

Automating recursive definitions and termination proofs in higher-order logic

A calculus for modular loop acceleration and non-termination proofs

Schriftgut

Lazy

Hochschulschrift

Automated termination proofs

Termination proofs for logic programs

Hochschulschrift

Termination proofs for logic programs

Continuous semantics for termination proofs

Termination Proofs of Rewriting Systems

A region graph based approach to termination proofs

A Region Graph Based Approach to Termination Proofs

Termination proofs and derivation lengths in term rewriting systems

Hochschulschrift

Automating recursive definitions and termination proofs in higher-order logic

A calculus for modular loop acceleration and non-termination proofs

Schriftgut

Lazy

Hochschulschrift

Automated termination proofs

Termination proofs for logic programs

Hochschulschrift

Termination proofs for logic programs

Continuous semantics for termination proofs

Termination Proofs of Rewriting Systems

A region graph based approach to termination proofs

A Region Graph Based Approach to Termination Proofs

Termination proofs and derivation lengths in term rewriting systems

Hochschulschrift

Automating recursive definitions and termination proofs in higher-order logic

A calculus for modular loop acceleration and non-termination proofs

Schriftgut

Lazy

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Termination proofs for a lazy functional language by abstract reduction : (draft)

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Automated termination proofs

Termination proofs for logic programs

Termination proofs for logic programs

Continuous semantics for termination proofs

Termination Proofs of Rewriting Systems

A region graph based approach to termination proofs

A Region Graph Based Approach to Termination Proofs

Termination proofs and derivation lengths in term rewriting systems

Automating recursive definitions and termination proofs in higher-order logic

A calculus for modular loop acceleration and non-termination proofs

A calculus for modular loop acceleration and non-termination proofs

Lazy

Automated termination proofs

Termination proofs for logic programs

Termination proofs for logic programs

Continuous semantics for termination proofs

Termination Proofs of Rewriting Systems

A region graph based approach to termination proofs

A Region Graph Based Approach to Termination Proofs

Termination proofs and derivation lengths in term rewriting systems

Automating recursive definitions and termination proofs in higher-order logic

A calculus for modular loop acceleration and non-termination proofs

A calculus for modular loop acceleration and non-termination proofs

Lazy

Automated termination proofs

Termination proofs for logic programs

Termination proofs for logic programs

Continuous semantics for termination proofs

Termination Proofs of Rewriting Systems

A region graph based approach to termination proofs

A Region Graph Based Approach to Termination Proofs

Termination proofs and derivation lengths in term rewriting systems

Automating recursive definitions and termination proofs in higher-order logic

A calculus for modular loop acceleration and non-termination proofs

A calculus for modular loop acceleration and non-termination proofs

Lazy

Related objects

Reset password