[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1102.3734v1 (cs)
[Submitted on 18 Feb 2011]

Title:A standardisation proof for algebraic pattern calculi

Authors:Delia Kesner (PPS, CNRS and Universite Paris Diderot - France), Carlos Lombardi (Universidad Nacional de Quilmes - Argentina), Alejandro Ríos (Universidad de Buenos Aires - Argentina)
View PDF
Abstract:This work gives some insights and results on standardisation for call-by-name pattern calculi. More precisely, we define standard reductions for a pattern calculus with constructor-based data terms and patterns. This notion is based on reduction steps that are needed to match an argument with respect to a given pattern. We prove the Standardisation Theorem by using the technique developed by Takahashi and Crary for lambda-calculus. The proof is based on the fact that any development can be specified as a sequence of head steps followed by internal reductions, i.e. reductions in which no head steps are involved.
Comments: In Proceedings HOR 2010, arXiv:1102.3465
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
Cite as: arXiv:1102.3734 [cs.LO]
  (or arXiv:1102.3734v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1102.3734
Journal reference: EPTCS 49, 2011, pp. 58-72
Related DOI: https://doi.org/10.4204/EPTCS.49.5

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 18 Feb 2011 01:44:45 UTC (26 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2011-02
Change to browse by:
cs
cs.PL

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)