Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2007
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030186466443264
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:6665
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2007
publishDateSort 2007
record_format rss_article
spellingShingle Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
title_auth Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
title_full Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
title_fullStr Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
title_full_unstemmed Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
title_short Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
title_sort verification of ptime reducibility for system f terms: type inference in dual light affine logic
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.2168/LMCS-3(4:10)2007