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
11
search results - page 3 / 3
»
Encoding First Order Proofs in SMT
Sort
relevance
views
votes
recent
update
View
thumb
title
162
click to vote
IFIP
2004
Springer
108
views
Programming Languages
»
more
IFIP 2004
»
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
15 years 8 months ago
Download
rho.loria.fr
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
claim paper
Read More »
« Prev
« First
page 3 / 3
Last »
Next »