## Found 47 Documents (Results 1–47)

100
MathJax

MSC:  68-XX
Full Text:

### Factorization in call-by-name and call-by-value calculi via linear logic. (English)Zbl 07410426

Kiefer, Stefan (ed.) et al., Foundations of software science and computation structures. 24th international conference, FOSSACS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12650, 205-225 (2021).
MSC:  68Nxx 68Qxx
Full Text:

### The untyped computational $$\lambda$$-calculus and its intersection type discipline. (English)Zbl 1464.68056

MSC:  68N18 03B40 18C15
Full Text:

### Decomposing probabilistic lambda calculi. (English)Zbl 07250936

Goubault-Larrecq, Jean (ed.) et al., Foundations of software science and computation structures. 23rd international conference, FOSSACS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12077, 136-156 (2020).
MSC:  68Nxx 68Qxx
Full Text:

MSC:  03B45
Full Text:

### A formal system of reduction paths for parallel reduction. (English)Zbl 1433.68190

MSC:  68Q42 03B40 68R10
Full Text:

### A formalized general theory of syntax with bindings: extended version. (English)Zbl 1468.68073

MSC:  68N30 68Q60 68V20
Full Text:

### The bang calculus and the two Girard’s translations. (English)Zbl 07450000

Ehrhard, Thomas (ed.) et al., Proceedings of the joint international workshop on linearity & trends in linear logic and applications, Linearity-TLLA 2018, Oxford, UK, July 7–8, 2018. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 292, 15-30 (2019).
MSC:  03F52 03B40 68N18
Full Text:

### A deterministic rewrite system for the probabilistic $$\lambda$$-calculus. (English)Zbl 1434.68091

MSC:  68N18 03B40 68Q55
Full Text:

### Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory. (English)Zbl 1433.68542

Alves, Sandra (ed.) et al., Selected papers of the 12th workshop on logical and semantic frameworks, with applications (LSFA 2017), Brasilia, Brazil, September 23–24, 2017. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 338, 79-95 (2018).
Full Text:

MSC:  03B40
Full Text:

MSC:  03B40
Full Text:

### Confluence of orthogonal term rewriting systems in the prototype verification system. (English)Zbl 1407.68441

MSC:  68T15 68N30 68Q42
Full Text:

MSC:  03B40
Full Text:

### Certifying confluence proofs via relative termination and rule labeling. (English)Zbl 1398.68485

MSC:  68T15 68Q42
Full Text:

### SMT solving for functional programming over infinite structures. (English)Zbl 1477.68072

Atkey, Robert (ed.) et al., Proceedings of the sixth workshop on mathematically structured functional programming, MSFP 2016, Eindhoven, Netherlands, April 8, 2016. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 207, 57-75 (2016).
MSC:  68N18
Full Text:

### Reasoning about multi-stage programs. (English)Zbl 1420.68040

MSC:  68N18 68N30
Full Text:

MSC:  03B40
Full Text:

### I got plenty o’ nuttin’. (English)Zbl 1343.68060

Lindley, Sam (ed.) et al., A list of successes that can change the world. Essays dedicated to Philip Wadler on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-30935-4/pbk; 978-3-319-30936-1/ebook). Lecture Notes in Computer Science 9600, 207-233 (2016).
Full Text:

### Termination of rewrite relations on $$\lambda$$-terms based on Girard’s notion of reducibility. (English)Zbl 1332.68103

MSC:  68Q42 03B40
Full Text:

### Head reduction and normalization in a call-by-value lambda-calculus. (English)Zbl 1428.68100

Chiba, Yuki (ed.) et al., Second international workshop on rewriting techniques for program transformations and evaluation, WPTE’15, Warsaw, Poland, July 2, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 46, 3-17 (2015).
MSC:  68N18
Full Text:

MSC:  03B40
Full Text:

### From search to computation: redundancy criteria and simplification at work. (English)Zbl 1383.68076

Voronkov, Andrei (ed.) et al., Programming logics. Essays in memory of Harald Ganzinger. Berlin: Springer (ISBN 978-3-642-37650-4/pbk). Lecture Notes in Computer Science 7797, 169-193 (2013).
MSC:  68T15 03B35 68Q42
Full Text:

### On the confluence of lambda-calculus with conditional rewriting. (English)Zbl 1209.68104

MSC:  68N18 68Q42
Full Text:

### Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms. (English)Zbl 1186.68102

Inf. Comput. 208, No. 3, 230-258 (2010); corrigendum ibid. 212, 119 (2012).
MSC:  68N18
Full Text:

MSC:  68N18
Full Text:

### Nominal techniques in Isabelle/HOL. (English)Zbl 1140.68061

MSC:  68T15 03B40
Full Text:

### Strong normalization of classical natural deduction with disjunctions. (English)Zbl 1141.03027

MSC:  03F05 03B05 03B40
Full Text:

### Distributive $$\rho$$-calculus. (English)Zbl 1279.03057

Denker, Grit (ed.) et al., Proceedings of the 6th international workshop on rewriting logic and its applications (WRLA 2006), Vienna, Austria, April 1–2, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 176, No. 4, 95-111 (2007).
MSC:  03B70 03B40 68Q42
Full Text:

### Term collections in {$$\lambda$$} and {$$\rho$$}-calculi. (English)Zbl 1277.03010

Jouannaud, Jean-Pierre (ed.) et al., Proceedings of the second international workshop on developments in computational models (DCM 2006), Venice, Italy, July 16, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 171, No. 3, 3-19 (2007).
MSC:  03B40 68Q42 68Q55
Full Text:

Full Text:

### Non-strictly positive fixed points for classical natural deduction. (English)Zbl 1066.03057

MSC:  03F05 03B40 68N18
Full Text:

### Tactics and parameters. (English)Zbl 1264.03042

Dahn, Ingo (ed.) et al., Proceedings of the workshop on mathematics, logic and computation (satellite event of ICALP 2003), Valencia, Spain, June 12–14, 2003. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 85, No. 7, 50-68 (2003).
MSC:  03B35 68T15
Full Text:

MSC:  68Q55
Full Text:

### A formalised first-order confluence proof for the $$\lambda$$-calculus using one-sorted variable names. (English)Zbl 1054.68028

MSC:  68N18 03B40 68T15
Full Text:

MSC:  68N18
Full Text:

### Church-Rosser property of a simple reduction for full first-order classical natural deduction. (English)Zbl 1016.03006

MSC:  03B10 03B40 03F05
Full Text:

### Conservation and uniform normalization in lambda calculi with erasing reductions. (English)Zbl 1012.03022

MSC:  03B40 68N18
Full Text:

### The mechanisation of Barendregt-style equational proofs (the residual perspective). (English)Zbl 1268.68057

Ambler, S. J. (ed.) et al., MERLIN 2001. Proceedings of the workshop on mechanized reasoning about languages with variable binding (in connection with IJCAR 2001), Siena, Italy, June 18, 2001. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 58, No. 1, 18-36 (2001).
MSC:  68N18 68T15
Full Text:

MSC:  68N18
Full Text:

### Descendants and origins in term rewriting. (English)Zbl 1046.68564

MSC:  68Q42 03B40
Full Text:

MSC:  03-06
Full Text:

### Monotone (co)inductive types and positive fixed-point types. (English)Zbl 0940.03018

MSC:  03B40 68Q42 68Q65
Full Text:

MSC:  03B40
Full Text:

MSC:  03B40
Full Text:

MSC:  68N15
Full Text:

### More Church-Rosser proofs (in Isabelle/HOL). (English)Zbl 1412.68248

McRobbie, M. A. (ed.) et al., Automated deduction – CADE-13. 13th international conference on automated deduction, New Brunswick, NJ, USA, July/August 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1104, 733-747 (1996).
MSC:  68T15 03B40
Full Text:

all top 5

all top 5

all top 3