Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
16
search results - page 1 / 4
»
tlca 2009
Sort
relevance
views
votes
recent
update
View
thumb
title
232
click to vote
TLCA
2009
Springer
266
views
Theoretical Computer Science
»
more
TLCA 2009
»
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
15 years 9 months ago
Download
eprint.iacr.org
Yu Zhang
claim paper
Read More »
103
click to vote
TLCA
2009
Springer
135
views
Theoretical Computer Science
»
more
TLCA 2009
»
The Cut-Elimination Theorem for Differential Nets with Promotion
15 years 7 months ago
Download
perso.ens-lyon.fr
Michele Pagani
claim paper
Read More »
115
click to vote
TLCA
2009
Springer
129
views
Theoretical Computer Science
»
more
TLCA 2009
»
Refinement Types as Proof Irrelevance
15 years 7 months ago
Download
www.cs.cmu.edu
William Lovas, Frank Pfenning
claim paper
Read More »
125
click to vote
TLCA
2009
Springer
145
views
Theoretical Computer Science
»
more
TLCA 2009
»
Mathematical Synthesis of Equational Deduction Systems
15 years 9 months ago
Download
www.cl.cam.ac.uk
Marcelo P. Fiore, Chung-Kil Hur
claim paper
Read More »
147
click to vote
TLCA
2009
Springer
124
views
Theoretical Computer Science
»
more
TLCA 2009
»
Syntax for Free: Representing Syntax with Binding Using Parametricity
15 years 9 months ago
Download
personal.cis.strath.ac.uk
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
claim paper
Read More »
« Prev
« First
page 1 / 4
Last »
Next »