Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Modified basic functionality in combinatory logic

From MaRDI portal
Publication:5672870
Jump to:navigation, search

DOI10.1111/j.1746-8361.1969.tb01183.xzbMath0257.02018OpenAlexW2034589435MaRDI QIDQ5672870

Haskell B. Curry

Publication date: 1969

Published in: dialectica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1746-8361.1969.tb01183.x



Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)


Related Items

Type inference in polymorphic type discipline ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Types with intersection: An introduction ⋮ Type inference with recursive types: Syntax and semantics ⋮ Extending the type checker of Standard ML by polymorphic recursion ⋮ On the semantics of polymorphism ⋮ The completeness theorem for typing lambda-terms ⋮ An NSF proposal



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5672870&oldid=30378861"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 05:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki