Normalization by evaluation for modal dependent type theory

Authors: JASON Z. S. HU, JUNYOUNG JANG, BRIGITTE PIENTKA

Source: Journal of Functional Programming. 33

Subject Terms: Type theory, Functional programming and lambda calculus, Modal logic (including the logic of norms)

File Description: application/xml

Access URL: https://zbmath.org/7775446
https://doi.org/10.1017/s0956796823000060

Formally Proving Size Optimality of Sorting Networks: Formally proving size optimality of sorting networks

Authors: Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp

Source: Cruz-Filipe, L, Larsen, K S & Schneider-Kamp, P 2017, ' Formally Proving Size Optimality of Sorting Networks ', Journal of Automated Reasoning, vol. 59, no. 4, pp. 425-454 . https://doi.org/10.1007/s10817-017-9405-9

Subject Terms: Program extraction, 2. Zero hunger, interactive theorem proving, Specification and verification (program logics, model checking, etc.), sorting networks, Interactive theorem proving, program extraction, Analysis of algorithms and problem complexity, Sorting networks, 0102 computer and information sciences, 7. Clean energy, 01 natural sciences, large-scale proofs, Large-scale proofs, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0101 mathematics, Functional programming and lambda calculus, Theorem proving (deduction, resolution, etc.)

File Description: application/xml

Access URL: https://rd.springer.com/article/10.1007/s10817-017-9405-9
https://core.ac.uk/display/84096648
https://link.springer.com/article/10.1007/s10817-017-9405-9
https://dblp.uni-trier.de/db/journals/jar/jar59.html#Cruz-FilipeLS17
https://doi.org/10.1007/s10817-017-9405-9
https://portal.findresearcher.sdu.dk/da/publications/c499aa7f-a152-4ac2-9781-b62202884c89

FUNCTIONAL PEARL Parsing permutation phrases: Parsing permutation phrases

Authors: S. Doaitse Swierstra, Arthur Baars, Andres Löh

Source: Journal of Functional Programming. 14:635-646

Subject Terms: parser combinator libraries, 0202 electrical engineering, electronic engineering, information engineering, Wiskunde en Informatica (WIIN), 02 engineering and technology, Functional programming and lambda calculus, 7. Clean energy, 12. Responsible consumption

File Description: application/xml

Access URL: https://zbmath.org/2148713
https://doi.org/10.1017/s0956796804005143
http://10.10.70.176:8080/experts/en/publications/ab6c651f-fea0-4341-8ae4-c9fc71379d92
https://research-portal.uu.nl/en/publications/adbe570c-1aaf-45d0-91e4-11a5e442dfe1
https://dl.acm.org/doi/10.1017/S0956796804005143
https://dl.acm.org/citation.cfm?id=1030338
https://www.cambridge.org/core/journals/journal-of-functional-programming/article/functional-pearl-parsing-permutation-phrases/DB7B6AFE506CF84BBDBBF54306F28D38

On the Representation of McCarthy's amb in the π-calculus: On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus

Authors: A. Carayol, D. Hirschkoff, SANGIORGI, DAVIDE

Source: Electronic Notes in Theoretical Computer Science. 96:73-89

Subject Terms: Pi-Calculus, Fairness, General Computer Science, Lambda-calculus, π-calculus, Behavioural equivalence, \(\pi\)-calculus, Semantics | Computer programming languages | Differentiation (calculus), 0102 computer and information sciences, 02 engineering and technology, Behavioural equivalence, 16. Peace & justice, 01 natural sciences, Theoretical Computer Science, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), 0202 electrical engineering, electronic engineering, information engineering, Lambda-calculus, 0101 mathematics, McCarhty's amb, Functional programming and lambda calculus, Lambda-Calculus, Computer Science(all)

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/entcs/entcs96.html#CarayolHS04
https://core.ac.uk/display/82507301
https://www.sciencedirect.com/science/article/pii/S1571066104050327
https://www.openaccessrepository.it/record/25063
https://hdl.handle.net/11585/26388

Monad-Independent Dynamic Logic in HasCasl: Monad-independent dynamic logic in HasCasl

Authors: Till Mossakowski, Lutz Schröder

Source: Lecture Notes in Computer Science ISBN: 9783540205371

Subject Terms: 2. Zero hunger, Logic in computer science, Specification and verification (program logics, model checking, etc.), 4. Education, functional programming, monads, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, dynamic logic, Casl, 0202 electrical engineering, electronic engineering, information engineering, Functional programming and lambda calculus, algebraic specifications, Abstract data types, algebraic specification

File Description: application/xml

Access URL: https://zbmath.org/2112324
https://doi.org/10.1093/logcom/14.4.571
https://dblp.uni-trier.de/db/conf/wadt/wadt2002.html#SchroderM02
http://core.ac.uk/display/24595177
https://link.springer.com/chapter/10.1007/978-3-540-40020-2_25
https://dblp.uni-trier.de/db/journals/logcom/logcom14.html#SchroderM04
http://academic.oup.com/logcom/article-abstract/14/4/571/933561
https://rd.springer.com/chapter/10.1007/978-3-540-40020-2_25
https://link.springer.com/chapter/10.1007/978-3-540-40020-2_25
https://academic.oup.com/logcom/article/14/4/571/933561

Using circular programs to deforest in accumulating parameters

Authors: Voigtländer, Janis

Source: Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation. :126-137

Subject Terms: program transformation, tree transducers, accumulating arguments, intermediate results, circular programs, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, unfold/fold, Informatik, tupling, 0202 electrical engineering, electronic engineering, information engineering, Functional programming and lambda calculus, (short cut) deforestation

File Description: application/xml

Access URL: https://zbmath.org/2145979
https://doi.org/10.1023/b:lisp.0000029450.36668.cb
https://dblp.uni-trier.de/db/conf/pepm/asiapepm2002.html#Voigtlander02
https://dl.acm.org/doi/10.1145/568173.568187
https://link.springer.com/article/10.1023/B%3ALISP.0000029450.36668.cb
https://core.ac.uk/display/21551290
https://link.springer.com/article/10.1023/B:LISP.0000029450.36668.cb
https://doi.org/10.1023/B:LISP.0000029450.36668.cb
https://dblp.uni-trier.de/db/journals/lisp/lisp17.html#Voigtlander04
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=0036957022
https://doi.org/10.1145/568173.568187
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=3042841950
https://doi.org/10.1023/B:LISP.0000029450.36668.cb

A new connective in natural deduction, and its application to quantum computing

Authors: Alejandro Díaz-Caro, Gilles Dowek

Contributors: Dowek, Gilles

Source: Lecture Notes in Computer Science ISBN: 9783030853143

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], lambda calculus, 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences, quantum computing, QUANTUM COMPUTING, Proof-reduction, type theory, Quantum computation, Logical foundations of quantum mechanics, quantum logic (quantum-theoretic aspects), 0101 mathematics, Functional programming and lambda calculus, Lambda calculus, proof-reduction, LAMBDA CALCULUS, Quantum computing 2020 MSC: 03F05, Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.), Type theory, PROOF-REDUCTION, Quantum algorithms and complexity in the theory of computing, Quantum measurement theory, state operations, state preparations, Logic in Computer Science (cs.LO), TYPE THEORY, Holomorphically convex complex spaces, reduction theory

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/pdf/2012.08994
http://arxiv.org/abs/2012.08994
https://arxiv.org/pdf/2012.08994.pdf
https://ui.adsabs.harvard.edu/abs/2020arXiv201208994D/abstract
https://arxiv.org/abs/2012.08994
https://link.springer.com/chapter/10.1007/978-3-030-85315-0_11
https://dblp.uni-trier.de/db/journals/corr/corr2012.html#abs-2012-08994
http://hdl.handle.net/11336/218752

A first-order one-pass CPS transformation

Authors: Danvy, Olivier, Nielsen, Lasse Reichstein

Source: Lecture Notes in Computer Science ISBN: 9783540433668
Danvy, O & Nielsen, L R 2003, 'A First-Order One-Pass CPS Transformation', Theoretical Computer Science, vol. 308, no. 1, pp. 239-257.
Danvy, O & Nielsen, L R 2001, 'A First-Order One-Pass CPS Transformation', B R I C S Report Series, vol. RS-01-49.

Subject Terms: Continuation-passing style, λ-calculus, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, administrative reductions, \(\lambda\)-calculus, administrative reduction, Theoretical Computer Science, continuation-passing style(CPS), continuations, Continuations, Continuation-passing style (CPS), CPS transformation, Administrative reductions, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, continuation-passing style (CPS), Functional programming and lambda calculus, Computer Science(all)

File Description: application/xml

Access URL: https://tidsskrift.dk/brics/article/download/21709/19145
https://link.springer.com/content/pdf/10.1007%2F3-540-45931-6_8.pdf
https://zbmath.org/2110980
https://doi.org/10.1016/s0304-3975(02)00733-8
https://tidsskrift.dk/brics/article/download/21709/19145
https://tidsskrift.dk/brics/article/view/21709
https://cs.au.dk/~danvy/DSc/11_danvy-nielsen_tcs-2003.pdf
https://link.springer.com/chapter/10.1007/3-540-45931-6_8
https://rd.springer.com/chapter/10.1007%2F3-540-45931-6_8
https://dblp.uni-trier.de/db/conf/fossacs/fossacs2002.html#DanvyN02
https://link.springer.com/content/pdf/10.1007%2F3-540-45931-6_8.pdf
https://pure.au.dk/portal/en/publications/391192a0-3524-11dc-bee9-02004c4f4f50
https://pure.au.dk/portal/en/publications/5ee7ac50-98eb-11dc-bee9-02004c4f4f50

Non-determinism analyses in a parallel-functional language

Authors: Clara Segura, Ricardo Peña

Source: Lecture Notes in Computer Science ISBN: 9783540419198

Subject Terms: merge, Eden, Theory of programming languages, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Functional programming and lambda calculus, denotational semantics

File Description: application/xml

Access URL: https://zbmath.org/2152489
https://doi.org/10.1017/s0956796804005295
http://www.journals.cambridge.org/abstract_S0956796804005295
https://dblp.uni-trier.de/db/journals/jfp/jfp15.html#PenaS05
https://rd.springer.com/chapter/10.1007/3-540-45361-X_1
https://www.cambridge.org/core/journals/journal-of-functional-programming/article/nondeterminism-analyses-in-a-parallelfunctional-language/8D69E37F6547488134C6DE1E724CABB6
https://link.springer.com/chapter/10.1007/3-540-45361-X_1
https://dblp.uni-trier.de/db/conf/ifl/ifl2000.html#PenaS00
https://link.springer.com/10.1007/3-540-45361-X_1
https://link.springer.com/chapter/10.1007/3-540-45361-X_1

Reductions, intersection types, and explicit substitutions

Authors: Pierre Lescanne, Daniel J. Dougherty

Source: Lecture Notes in Computer Science ISBN: 9783540419600

Subject Terms: strong normalisation, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, typability, 0102 computer and information sciences, 02 engineering and technology, Functional programming and lambda calculus, 01 natural sciences, \(\lambda\)-calculus, explicit substitutions

File Description: application/xml

Access URL: http://www.doc.ic.ac.uk/~svb/Research/Papers/LLDDvB.pdf
https://rd.springer.com/chapter/10.1007/3-540-45413-6_13
https://doi.org/10.1007/3-540-45413-6_13
https://core.ac.uk/display/22280589
https://link.springer.com/chapter/10.1007%2F3-540-45413-6_13
https://dblp.uni-trier.de/db/conf/tlca/tlca2001.html#DoughertyL01
https://link.springer.com/content/pdf/10.1007%2F3-540-45413-6_13.pdf

(Optimal) duplication is not elementary recursive

Authors: ASPERTI, ANDREA, P. Coppola, MARTINI, SIMONE

Source: Information and Computation. 193:21-56

Subject Terms: elementary affine logic, Proof-theoretic aspects of linear logic and other substructural logics, Complexity, 0102 computer and information sciences, 01 natural sciences, Optimal reduction, Theoretical Computer Science, Computer Science Applications, Graph rewriting, Elementary affine logic, Lamping's algorithm, Computational Theory and Mathematics, Combinatory logic and lambda calculus, SHARING, LAMBDA CALCULUS, FUNCTIONAL PROGRAMMING, 0101 mathematics, Functional programming and lambda calculus, Information Systems

File Description: application/xml

Access URL: https://zbmath.org/2105974
https://doi.org/10.1016/j.ic.2004.05.001
https://dl.acm.org/doi/10.1145/325694.325707
https://www.sciencedirect.com/science/article/pii/S0890540104000884
https://dblp.uni-trier.de/db/conf/popl/popl2000.html#AspertiCM00
https://cris.unibo.it/handle/11585/14100
https://core.ac.uk/display/23657302
https://www.sciencedirect.com/science/article/abs/pii/S0890540104000884
https://hdl.handle.net/11390/849373
https://hdl.handle.net/11585/14100
https://doi.org/10.1016/j.ic.2004.05.001

Compiling embedded languages

Authors: Sigbjorn Finne, Conal Elliott, Oege de Moor

Source: Lecture Notes in Computer Science ISBN: 9783540410546

Subject Terms: Domain-Specific Embedded Languages, Functional languages, Theory of programming languages, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Functional programming and lambda calculus, 01 natural sciences

File Description: application/xml

Access URL: https://research.microsoft.com/apps/pubs/default.aspx?id=68633
https://doi.org/10.1007/3-540-45350-4_5
https://www.microsoft.com/en-us/research/publication/compiling-embedded-languages/
https://dblp.uni-trier.de/db/conf/saig/saig2000.html#ElliottFM00
http://conal.net/papers/saig00/compile-dsel.pdf
https://link.springer.com/chapter/10.1007/3-540-45350-4_5

Linear-Time Self-Interpretation of the Pure Lambda Calculus: Linear-time self-interpretation of the pure lambda calculus

Authors: Torben Æ. Mogensen

Source: Lecture Notes in Computer Science ISBN: 9783540671022

Subject Terms: linear-time self-interpretation, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Functional programming and lambda calculus, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1574439
https://doi.org/10.1023/a:1010058213619
https://rd.springer.com/chapter/10.1007%2F3-540-46562-6_11
https://dblp.uni-trier.de/db/conf/ershov/ershov1999.html#Mogensen99
https://link.springer.com/chapter/10.1007/3-540-46562-6_11

Region Analysis and a π-Calculus with Groups: Region analysis and a \(\pi\)-calculus with groups

Authors: Silvano Dal Zilio, Andrew D. Gordon

Contributors: Dissemin, Projet

Source: Lecture Notes in Computer Science ISBN: 9783540679011

Subject Terms: typed \(\pi\)-calculus, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Functional programming and lambda calculus, dissemin, 01 natural sciences, 7. Clean energy, 12. Responsible consumption

File Description: application/pdf; application/xml

Access URL: https://zenodo.org/record/32926/files/article.pdf
https://zenodo.org/record/345831/files/article.pdf
https://hal.science/hal-01483576v1
https://hal.science/hal-01483576v1/document
https://doi.org/10.1007/3-540-44612-5_1
https://zbmath.org/1775026
https://doi.org/10.1017/s0956796801004270
https://www.microsoft.com/en-us/research/wp-content/uploads/2000/01/regions-mfcs.pdf
https://sandbox.zenodo.org/record/32926
https://www.microsoft.com/en-us/research/publication/region-analysis-and-a-pi-calculus-with-groups-2000/
http://journals.cambridge.org/abstract_S0956796801004270
https://research.microsoft.com/apps/pubs/default.aspx?id=68641
https://link.springer.com/chapter/10.1007%2F3-540-44612-5_1

Specification and correctness of lambda lifting

Authors: Adam Fischbach, John Hannan

Source: Lecture Notes in Computer Science ISBN: 9783540410546

Subject Terms: operational semantics, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Functional programming and lambda calculus, 16. Peace & justice

File Description: application/xml

Access URL: https://zbmath.org/1941632
https://doi.org/10.1017/s0956796802004604
https://dblp.uni-trier.de/db/conf/saig/saig2000.html#FischbachH00
https://rd.springer.com/chapter/10.1007/3-540-45350-4_10
https://pennstate.pure.elsevier.com/en/publications/specification-and-correctness-of-lambda-lifting-2
https://link.springer.com/chapter/10.1007/3-540-45350-4_10

Compositional Characterizations of λ-Terms Using Intersection Types: Compositional characterisations of \(\lambda\)-terms using intersection types

Authors: DEZANI, Mariangiola, F. HONSELL, Y. MOTOHAMA

Source: Lecture Notes in Computer Science ISBN: 9783540679011

Subject Terms: Set-theoretical semantics of types, 0202 electrical engineering, electronic engineering, information engineering, λ-calculus, 02 engineering and technology, Intersection types, 0102 computer and information sciences, 0101 mathematics, Normalisation properties, Functional programming and lambda calculus, 01 natural sciences

File Description: application/xml; application/pdf

Access URL: https://hdl.handle.net/2318/4652
https://hdl.handle.net/2318/40766

CPS Translations and Applications: The Cube and Beyond: CPS translations and applications: The cube and beyond

Authors: Bathe, Gilles, Hatcliff, John, Sørensen, Morten Heine

Source: Higher-Order and Symbolic Computation. 12:125-170

Subject Terms: Logic in computer science, domain-free \(\lambda\)-cube, direct style translations, dependent types, lambda calculus, logical frameworks, 0102 computer and information sciences, 02 engineering and technology, continuation passing style translations of typed \(\lambda\)-calculi, 01 natural sciences, domain-free pure type systems, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, Functional programming and lambda calculus, calculus of constructions

File Description: application/xml

Access URL: https://zbmath.org/1375360
https://doi.org/10.1023/a:1010000206149
https://link.springer.com/article/10.1023%2FA%3A1010000206149
https://dl.acm.org/doi/10.1023/A%3A1010000206149
https://dblp.uni-trier.de/db/journals/lisp/lisp12.html#BartheHS99

Erratic Fudgets: a semantic theory for an embedded coordination language: Erratic Fudgets: A semantic theory for an embedded coordination language

Authors: Magnus Carlsson, Andrew Moran, David Sands

Source: Lecture Notes in Computer Science ISBN: 9783540658368

Subject Terms: constructive type theory, Haskell, Theory of programming languages, Semantics in the theory of computing, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Functional programming and lambda calculus, 01 natural sciences, Software

File Description: application/xml

Access URL: https://zbmath.org/1910208
https://doi.org/10.1016/s0167-6423(02)00088-6
https://link.springer.com/chapter/10.1007/3-540-48919-3_8
https://link.springer.com/content/pdf/10.1007%2F3-540-48919-3_8.pdf
https://rd.springer.com/chapter/10.1007/3-540-48919-3_8
http://core.ac.uk/display/23270424
https://dblp.uni-trier.de/db/conf/coordination/coordination1999.html#MoranSC99

Prelogical Relations: Prelogical relations

Authors: Furio Honsell, Donald Sannella

Source: Lecture Notes in Computer Science ISBN: 9783540665366

Subject Terms: Data refinement, Logical relations, Representation independence, Semantics, Typed lambda calculus, Logic in computer science, Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, 0102 computer and information sciences, 02 engineering and technology, Functional programming and lambda calculus, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

File Description: application/xml; application/pdf

Access URL: https://dblp.uni-trier.de/db/conf/csl/csl99.html#HonsellS99
https://link.springer.com/content/pdf/10.1007%2F3-540-48168-0_38.pdf
https://core.ac.uk/display/20680454
https://doi.org/10.1007/3-540-48168-0_38
http://homepages.inf.ed.ac.uk/dts/pub/prelogrel.pdf
https://rd.springer.com/chapter/10.1007/3-540-48168-0_38
https://dl.acm.org/citation.cfm?id=603645.603648
https://www.research.ed.ac.uk/portal/en/publications/prelogical-relations(f2b272b9-395f-4a7c-8feb-90adbe93141a)/export.html
http://www.sciencedirect.com/science/article/pii/S0890540102931159
https://doi.org/10.1006/inco.2002.3115
https://hdl.handle.net/11390/714049

Binding-Time Analysis for Both Static and Dynamic Expressions: Binding-time analysis for both static and dynamic expressions

Authors: Kenichi Asai

Source: Lecture Notes in Computer Science ISBN: 9783540664598

Subject Terms: binding-time analyzer, 4. Education, Theory of programming languages, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Functional programming and lambda calculus, constraint solving algorithm

File Description: application/xml

Access URL: https://rd.springer.com/chapter/10.1007/3-540-48294-6_8
https://link.springer.com/article/10.1007/BF03037258
https://core.ac.uk/display/20933056
https://dblp.uni-trier.de/db/conf/sas/sas99.html#Asai99
https://dblp.uni-trier.de/db/journals/ngc/ngc20.html#Asai01
https://link.springer.com/content/pdf/10.1007/BF03037258.pdf
https://link.springer.com/article/10.1007/BF03037258