Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Soft lambda-Calculus: A Language for Polynomial Time Computation
HTML
PDF
Details
Locations
Year:
2004
Type:
conference-paper
Source:
Lecture notes in computer science
Parent work:
Foundations of Software Science and Computation Structures: 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004. Proceedings
DOI:
10.1007/978-3-540-24727-2_4
Authors:
Patrick Baillot,
Virgile Mogbil
Institutions:
Centre National de la Recherche Scientifique,
Université Sorbonne Paris Nord,
Laboratoire d'Informatique de Paris-Nord
Language:
English
Topic:
Logic, programming, and type systems
Subfield:
Software
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
polynomial-time computation,
affine logic,
intuitionistic logic,
recursive types,
insertion sort,
type systems
show all 6
Open Access status:
bronze
Funder:
Centre National de la Recherche Scientifique
OpenAlex ID:
W1856607635
FWCI:
2.502
Cites:
23
Cited by:
65
Related to:
9