Subjects -> COMPUTER SCIENCE (Total: 2313 journals)
    - ANIMATION AND SIMULATION (33 journals)
    - ARTIFICIAL INTELLIGENCE (133 journals)
    - AUTOMATION AND ROBOTICS (116 journals)
    - CLOUD COMPUTING AND NETWORKS (75 journals)
    - COMPUTER ARCHITECTURE (11 journals)
    - COMPUTER ENGINEERING (12 journals)
    - COMPUTER GAMES (23 journals)
    - COMPUTER PROGRAMMING (25 journals)
    - COMPUTER SCIENCE (1305 journals)
    - COMPUTER SECURITY (59 journals)
    - DATA BASE MANAGEMENT (21 journals)
    - DATA MINING (50 journals)
    - E-BUSINESS (21 journals)
    - E-LEARNING (30 journals)
    - ELECTRONIC DATA PROCESSING (23 journals)
    - IMAGE AND VIDEO PROCESSING (42 journals)
    - INFORMATION SYSTEMS (109 journals)
    - INTERNET (111 journals)
    - SOCIAL WEB (61 journals)
    - SOFTWARE (43 journals)
    - THEORY OF COMPUTING (10 journals)

COMPUTER PROGRAMMING (25 journals)

Showing 1 - 25 of 25 Journals sorted alphabetically
ACM SIGPLAN Fortran Forum     Full-text available via subscription   (Followers: 3)
ACM Transactions on Programming Languages and Systems (TOPLAS)     Hybrid Journal   (Followers: 18)
Acta Informatica     Hybrid Journal   (Followers: 5)
Advances in Image and Video Processing     Open Access   (Followers: 28)
Algorithmica     Hybrid Journal   (Followers: 9)
An International Journal of Optimization and Control: Theories & Applications     Open Access   (Followers: 12)
Computer Methods and Programs in Biomedicine     Hybrid Journal   (Followers: 6)
Constraints     Hybrid Journal  
Grey Systems : Theory and Application     Hybrid Journal  
International Journal of Parallel Programming     Hybrid Journal   (Followers: 6)
International Journal of People-Oriented Programming     Full-text available via subscription  
International Journal of Soft Computing and Software Engineering     Open Access   (Followers: 14)
Journal of Computer Languages     Hybrid Journal   (Followers: 5)
Journal of Functional Programming     Hybrid Journal   (Followers: 1)
Journal of Logical and Algebraic Methods in Programming     Hybrid Journal   (Followers: 1)
Linux Journal     Full-text available via subscription   (Followers: 25)
Mathematical and Computational Applications     Open Access   (Followers: 3)
Mathematical Programming     Hybrid Journal   (Followers: 15)
Optimization: A Journal of Mathematical Programming and Operations Research     Hybrid Journal   (Followers: 6)
Proceedings of the ACM on Programming Languages     Open Access   (Followers: 5)
Programming and Computer Software     Hybrid Journal   (Followers: 16)
Python Papers     Open Access   (Followers: 11)
Python Papers Monograph     Open Access   (Followers: 4)
Science of Computer Programming     Hybrid Journal   (Followers: 14)
Theory and Practice of Logic Programming     Hybrid Journal   (Followers: 3)
Similar Journals
Journal Cover
Journal of Functional Programming
Journal Prestige (SJR): 0.458
Citation Impact (citeScore): 1
Number of Followers: 1  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 0956-7968 - ISSN (Online) 1469-7653
Published by Cambridge University Press Homepage  [353 journals]
  • Alice or Bob': Process polymorphism in choreographies

    • Free pre-print version: Loading...

      Authors: GRAVERSEN; EVA, HIRSCH, ANDREW K., MONTESI, FABRIZIO
      First page: 1
      Abstract: We present PolyChor, a language for higher-order functional choreographic programming—an emerging paradigm for concurrent programming. In choreographic programming, programmers write the desired cooperative behaviour of a system of processes and then compile it into an implementation for each process, a translation called endpoint projection. Unlike its predecessor, Chor, PolyChor has both type and process polymorphism inspired by System F. That is, PolyChor is the first (higher-order) functional choreographic language which gives programmers the ability to write generic choreographies and determine the participants at runtime. This novel combination of features also allows PolyChor processes to communicate distributed values, leading to a new and intuitive way to write delegation. While some of the functional features of PolyChor give it a weaker correspondence between the semantics of choreographies and their endpoint-projected concurrent systems than some other choreographic languages, we still get the hallmark end result of choreographic programming: projected programmes are deadlock-free by design.
      PubDate: 2024-01-23
      DOI: 10.1017/S0956796823000114
       
  • Sparcl: A language for partially invertible computation

    • Free pre-print version: Loading...

      Authors: MATSUDA; KAZUTAKA, WANG, MENG
      First page: 2
      Abstract: Invertibility is a fundamental concept in computer science, with various manifestations in software development (serializer/deserializer, parser/printer, redo/undo, compressor/decompressor, and so on). Full invertibility necessarily requires bijectivity, but the direct approach of composing bijective functions to develop invertible programs is too restrictive to be useful. In this paper, we take a different approach by focusing on partially invertible functions—functions that become invertible if some of their arguments are fixed. The simplest example of such is addition, which becomes invertible when fixing one of the operands. More involved examples include entropy-based compression methods (e.g., Huffman coding), which carry the occurrence frequency of input symbols (in certain formats such as Huffman tree), and fixing this frequency information makes the compression methods invertible.We develop a language Sparcl for programming such functions in a natural way, where partial invertibility is the norm and bijectivity is a special case, hence gaining significant expressiveness without compromising correctness. The challenge in designing such a language is to allow ordinary programming (the “partially” part) to interact with the invertible part freely, and yet guarantee invertibility by construction. The language Sparcl is linear-typed and has a type constructor to distinguish data that are subject to invertible computation and those that are not. We present the syntax, type system, and semantics of the language and prove that Sparcl correctly guarantees invertibility for its programs. We demonstrate the expressiveness of Sparcl with examples including tree rebuilding from preorder and inorder traversals, Huffman coding, arithmetic coding, and LZ77 compression.
      PubDate: 2024-01-26
      DOI: 10.1017/S0956796823000126
       
  • Knuth–Morris–Pratt illustrated

    • Free pre-print version: Loading...

      Authors: MOY; CAMERON
      First page: 3
      Abstract: The Knuth–Morris–Pratt (KMP) algorithm for string search is notoriously difficult to understand. Lost in a sea of index arithmetic, most explanations of KMP obscure its essence. This paper constructs KMP incrementally, using pictures to illustrate each step. The end result is easier to comprehend. Additionally, the derivation uses only elementary functional programming techniques.
      PubDate: 2024-01-30
      DOI: 10.1017/S0956796824000017
       
  • Static Blame for gradual typing

    • Free pre-print version: Loading...

      Authors: SU; CHENGHAO, CHEN, LIN, YANHUI, LI, ZHOU, YUMING
      First page: 4
      Abstract: Gradual typing integrates static and dynamic typing by introducing a dynamic type and a consistency relation. A problem of gradual type systems is that dynamic types can easily hide erroneous data flows since consistency relations are not transitive. Therefore, a more rigorous static check is required to reveal these hidden data flows statically. However, in order to preserve the expressiveness of gradually typed languages, static checks for gradually typed languages cannot simply reject programs with potentially erroneous data flows. By contrast, a more reasonable request is to show how these data flows can affect the execution of the program. In this paper, we propose and formalize Static Blame, a framework that can reveal hidden data flows for gradually typed programs and establish the correspondence between static-time data flows and runtime behavior. With this correspondence, we build a classification of potential errors detected from hidden data flows and formally characterize the possible impact of potential errors in each category on program execution, without simply rejecting the whole program. We implemented Static Blame on Grift, an academic gradually typed language, and evaluated the effectiveness of Static Blame by mutation analysis to verify our theoretical results. Our findings revealed that Static Blame exhibits a notable level of precision and recall in detecting type-related bugs. Furthermore, we conducted a manual classification to elucidate the reasons behind instances of failure. We also evaluated the performance of Static Blame, showing a quadratic growth in run time as program size increases.
      PubDate: 2024-03-25
      DOI: 10.1017/S0956796824000029
       
  • Asymptotic speedup via effect handlers

    • Free pre-print version: Loading...

      Authors: HILLERSTRÖM; DANIEL, LINDLEY, SAM, LONGLEY, JOHN
      First page: 5
      Abstract: We study a fundamental efficiency benefit afforded by delimited control, showing that for certain higher-order functions, a language with advanced control features offers an asymptotic improvement in runtime over a language without them. Specifically, we consider the generic count problem in the context of a pure functional base language and an extension with general effect handlers. We prove that admits an asymptotically more efficient implementation of generic count than any implementation in . We also show that this gap remains even when is extended to a language with affine effect handlers, which is strong enough to encode exceptions, local state, coroutines and single-shot continuations. This locates the efficiency difference in the gap between ‘single-shot’ and ‘multi-shot’ versions of delimited control.To our knowledge, these results are the first of their kind for control operators.
      PubDate: 2024-04-05
      DOI: 10.1017/S0956796824000030
       
  • A review for the Journal of Functional Programming of Sandy Maguire,
           Algebra-Driven Design (Leanpub, 2020).

    • Free pre-print version: Loading...

      Authors: SPERBER; MICHAEL
      First page: 6
      PubDate: 2024-05-24
      DOI: 10.1017/S0956796824000042
       
  • Signature restriction for polymorphic algebraic effects

    • Free pre-print version: Loading...

      Authors: SEKIYAMA; TARO, TSUKADA, TAKESHI, IGARASHI, ATSUSHI
      First page: 7
      Abstract: The naive combination of polymorphic effects and polymorphic type assignment has been well known to break type safety. In the literature, there are two kinds of approaches to this problem: one is to restrict how effects are triggered and the other is to restrict how they are implemented. This work explores a new approach to ensuring the safety of the use of polymorphic effects in polymorphic type assignment. A novelty of our work is to restrict effect interfaces. To formalize our idea, we employ algebraic effects and handlers, where an effect interface is given by a set of operations coupled with type signatures. We propose signature restriction, a new notion to restrict the type signatures of operations and show that signature restriction ensures type safety of a language equipped with polymorphic effects and unrestricted polymorphic type assignment. We also develop a type-and-effect system to enable the use of both of the operations that satisfy and those that do not satisfy the signature restriction in a single program.
      PubDate: 2024-05-27
      DOI: 10.1017/S0956796824000054
       
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 18.97.9.171
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-
JournalTOCs
 
 
  Subjects -> COMPUTER SCIENCE (Total: 2313 journals)
    - ANIMATION AND SIMULATION (33 journals)
    - ARTIFICIAL INTELLIGENCE (133 journals)
    - AUTOMATION AND ROBOTICS (116 journals)
    - CLOUD COMPUTING AND NETWORKS (75 journals)
    - COMPUTER ARCHITECTURE (11 journals)
    - COMPUTER ENGINEERING (12 journals)
    - COMPUTER GAMES (23 journals)
    - COMPUTER PROGRAMMING (25 journals)
    - COMPUTER SCIENCE (1305 journals)
    - COMPUTER SECURITY (59 journals)
    - DATA BASE MANAGEMENT (21 journals)
    - DATA MINING (50 journals)
    - E-BUSINESS (21 journals)
    - E-LEARNING (30 journals)
    - ELECTRONIC DATA PROCESSING (23 journals)
    - IMAGE AND VIDEO PROCESSING (42 journals)
    - INFORMATION SYSTEMS (109 journals)
    - INTERNET (111 journals)
    - SOCIAL WEB (61 journals)
    - SOFTWARE (43 journals)
    - THEORY OF COMPUTING (10 journals)

COMPUTER PROGRAMMING (25 journals)

Showing 1 - 25 of 25 Journals sorted alphabetically
ACM SIGPLAN Fortran Forum     Full-text available via subscription   (Followers: 3)
ACM Transactions on Programming Languages and Systems (TOPLAS)     Hybrid Journal   (Followers: 18)
Acta Informatica     Hybrid Journal   (Followers: 5)
Advances in Image and Video Processing     Open Access   (Followers: 28)
Algorithmica     Hybrid Journal   (Followers: 9)
An International Journal of Optimization and Control: Theories & Applications     Open Access   (Followers: 12)
Computer Methods and Programs in Biomedicine     Hybrid Journal   (Followers: 6)
Constraints     Hybrid Journal  
Grey Systems : Theory and Application     Hybrid Journal  
International Journal of Parallel Programming     Hybrid Journal   (Followers: 6)
International Journal of People-Oriented Programming     Full-text available via subscription  
International Journal of Soft Computing and Software Engineering     Open Access   (Followers: 14)
Journal of Computer Languages     Hybrid Journal   (Followers: 5)
Journal of Functional Programming     Hybrid Journal   (Followers: 1)
Journal of Logical and Algebraic Methods in Programming     Hybrid Journal   (Followers: 1)
Linux Journal     Full-text available via subscription   (Followers: 25)
Mathematical and Computational Applications     Open Access   (Followers: 3)
Mathematical Programming     Hybrid Journal   (Followers: 15)
Optimization: A Journal of Mathematical Programming and Operations Research     Hybrid Journal   (Followers: 6)
Proceedings of the ACM on Programming Languages     Open Access   (Followers: 5)
Programming and Computer Software     Hybrid Journal   (Followers: 16)
Python Papers     Open Access   (Followers: 11)
Python Papers Monograph     Open Access   (Followers: 4)
Science of Computer Programming     Hybrid Journal   (Followers: 14)
Theory and Practice of Logic Programming     Hybrid Journal   (Followers: 3)
Similar Journals
Similar Journals
HOME > Browse the 73 Subjects covered by JournalTOCs  
SubjectTotal Journals
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 18.97.9.171
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-